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!

Schreiben Sie den ersten Kommentar!