Fast distributed algorithms for testing graph properties

We initiate a thorough study of distributed property testing —producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, whi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Distributed computing Jg. 32; H. 1; S. 41 - 57
Hauptverfasser: Censor-Hillel, Keren, Fischer, Eldar, Schwartzman, Gregory, Vasudev, Yadu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2019
Springer Nature B.V
Schlagworte:
Algorithms
Computer Communication Networks
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Lower bounds
Machinery
Model testing
Properties (attributes)
Run time (computers)
Software Engineering/Programming and Operating Systems
Task complexity
Theory of Computation
Testing Bipartiteness
Proof Labeling Schemes
Dense Graph Model
Induced Subgraph
Property Testing
ISSN:0178-2770, 1432-0452
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We initiate a thorough study of distributed property testing —producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, while in the general model we obtain faster tests for triangle-freeness and cycle-freeness, and in the sparse model we obtain a faster test for bipartiteness. In addition, we show a logarithmic lower bound for testing bipartiteness and cycle-freeness, which holds even in the stronger LOCAL model. In most cases, aided by parallelism, the distributed algorithms have a much shorter running time than their counterparts from the sequential querying model of traditional property testing. More importantly, the distributed algorithms we develop for testing graph properties are in many cases much faster than what is known for exactly deciding whether the property holds. The simplest property testing algorithms allow a relatively smooth transition to the distributed model. For the more complex tasks we develop new machinery that may be of independent interest.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-2770
1432-0452
DOI:10.1007/s00446-018-0324-8