Property Testing of Planarity in the CONGEST model

@inproceedings{Levi2018PropertyTO,
  title={Property Testing of Planarity in the CONGEST model},
  author={Reut Levi and Moti Medina and Dana Ron},
  booktitle={PODC '18},
  year={2018}
}
  • Reut Levi, Moti Medina, Dana Ron
  • Published in PODC '18 2018
  • Computer Science
  • We give a distributed algorithm in the \sf CONGEST model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (DISC 2016), who recently initiated the study of property testing in the distributed setting, our algorithm gives the following guarantee: For a graph G = (V,E) and a distance parameter ε, if G is planar, then every node outputs \sf accept, and if G is ε-far from being planar (i.e., more than ε\cdot |E| edges need to… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    Distributed Algorithms for Planar Networks I: Planar Embedding

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Distributed Computing

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL