Fast distributed algorithms for testing graph properties

@article{CensorHillel2016FastDA,
  title={Fast distributed algorithms for testing graph properties},
  author={Keren Censor-Hillel and Eldar Fischer and Gregory Schwartzman and Yadu Vasudev},
  journal={Distributed Computing},
  year={2016},
  pages={1-17}
}
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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS