DeepAI AI Chat
Log In Sign Up

Property Testing of Planarity in the CONGEST model

by   Reut Levi, et al.
Weizmann Institute of Science
Tel Aviv University
Ben-Gurion University of the Negev

We give a distributed algorithm in the 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 accept, and if G is ϵ-far from being planar (i.e., more than ϵ· |E| edges need to be removed in order to make G planar), then with probability 1-1/ poly(n) at least one node outputs reject. The algorithm runs in O(|V|·(1/ϵ)) rounds, and we show that this result is tight in terms of the dependence on |V|. Our algorithm combines several techniques of graph partitioning and local verification of planar embeddings. Furthermore, we show how a main subroutine in our algorithm can be applied to derive additional results for property testing of cycle-freeness and bipartiteness, as well as the construction of spanners, in minor-free (unweighted) graphs.


page 1

page 2

page 3

page 4


Learning Very Large Graphs and Nonsingular Actions of Discrete Groups

Recently, Goldreich introduced the notion of property testing of bounded...

Spectral methods for testing cluster structure of graphs

In the framework of graph property testing, we study the problem of dete...

Testing Hamiltonicity (and other problems) in Minor-Free Graphs

In this paper we provide sub-linear algorithms for several fundamental p...

Distributed Computing Made Secure: A New Cycle Cover Theorem

In the area of distributed graph algorithms a number of network's entiti...