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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Distributed computing Ročník 32; číslo 1; s. 41 - 57
Hlavní autori:	Censor-Hillel, Keren, Fischer, Eldar, Schwartzman, Gregory, Vasudev, Yadu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!