License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2020.16
URN: urn:nbn:de:0030-drops-126190
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12619/
Czumaj, Artur ;
Fichtenberger, Hendrik ;
Peng, Pan ;
Sohler, Christian
Testable Properties in General Graphs and Random Order Streaming
Abstract
We consider the fundamental question of understanding the relative power of two important computational models: property testing and data streaming. We present a novel framework closely linking these areas in the setting of general graphs in the context of constant-query complexity testing and constant-space streaming. Our main result is a generic transformation of a one-sided error property tester in the random-neighbor model with constant query complexity into a one-sided error property tester in the streaming model with constant space complexity. Previously such a generic transformation was only known for bounded-degree graphs.
BibTeX - Entry
@InProceedings{czumaj_et_al:LIPIcs:2020:12619,
author = {Artur Czumaj and Hendrik Fichtenberger and Pan Peng and Christian Sohler},
title = {{Testable Properties in General Graphs and Random Order Streaming}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Jaros{\l}aw Byrka and Raghu Meka},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12619},
URN = {urn:nbn:de:0030-drops-126190},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.16},
annote = {Keywords: Graph property testing, sublinear algorithms, graph streaming algorithms}
}
Keywords: |
|
Graph property testing, sublinear algorithms, graph streaming algorithms |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
11.08.2020 |