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ženo v:

Podrobná bibliografie
Vydáno v:	Distributed computing Ročník 32; číslo 1; s. 41 - 57
Hlavní autoři:	Censor-Hillel, Keren, Fischer, Eldar, Schwartzman, Gregory, Vasudev, Yadu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2019 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!