Fast distributed algorithms for testing graph properties

Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We provide 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 and sparse models we obtain faster tests for triangle-freeness, cycle-freeness and bipartiteness, respectively. In addition, we show a logarithmic lower bound for testing bipartiteness and cycle-freeness, which holds even in the LOCAL model. In most cases, aided by parallelism, the distributed algorithms have a much shorter running time as compared to their counterparts from the sequential querying model of traditional property testing. The simplest property testing algorithms allow a relatively smooth transitioning to the distributed model. For the more complex tasks we develop new machinery that may be of independent interest.

Original languageEnglish
Title of host publicationDistributed Computing - 30th International Symposium, DISC 2016, Proceedings
EditorsCyril Gavoille, David Ilcinkas
Pages43-56
Number of pages14
DOIs
StatePublished - 2016
Event30th International Symposium on Distributed Computing, DISC 2016 - Paris, France
Duration: 27 Sep 201629 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9888 LNCS

Conference

Conference30th International Symposium on Distributed Computing, DISC 2016
Country/TerritoryFrance
CityParis
Period27/09/1629/09/16

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Fast distributed algorithms for testing graph properties'. Together they form a unique fingerprint.

Cite this