Testable bounded degree graph properties are random order streamable

Monemizadeh, M., Muthukrishnan, S., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2017) Testable bounded degree graph properties are random order streamable. In: Chatzigiannakis, I., Indyk, P., Kuhn, F. and Muscholl, A., (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. ICALP 2017, 10-14 Jul 2017, Warsaw, Poland. LIPIcs, 80 . Dagstuhl Publishing , Dagstuhl, Germany , 131:1-131:14. ISBN 9783959770415



Copyright, Publisher and Additional Information: © 2017 The Author(s). This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Keywords: Graph streaming algorithms; graph property testing; constant-time approximation algorithms
  • Published: 2017
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 01 Aug 2019 10:30
Last Modified: 01 Aug 2019 10:30
Status: Published
Publisher: Dagstuhl Publishing
Series Name: LIPIcs
Refereed: Yes
Identification Number: https://doi.org/10.4230/LIPIcs.ICALP.2017.131