Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs

The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs [20], no deterministic polylogarithmic algorithm is known. In this paper, we study the problem in graphs with bounded growth, an important family of graphs which includes the well-known unit disk graph and many variants thereof. Particularly, we propose a deterministic algorithm that computes a maximal independent set in time O(log Δ· log*n) in graphs with bounded growth, where n and Δ denote the number of nodes and the maximal degree in G, respectively.

[1]  P. Assouad.  Plongements lipschitziens dans ${\bbfR}\sp n$ , 1983 .

[2]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[3]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[4]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[5]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[6]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[7]  Andrew V. Goldberg,et al.  Parallel symmetry-breaking in sparse graphs , 1987, STOC.

[8]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Aravind Srinivasan,et al.  Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.

[10]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[11]  Nathan Linial.  Local-Global Phenomena in Graphs , 1993, Comb. Probab. Comput..

[12]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[13]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[14]  Lali Barrière,et al.  Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges , 2001, DIALM '01.

[15]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[16]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[17]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[18]  P. Assouad.  Plongements lipschitziens dans Rn , 2003 .

[19]  Kousha Etessami,et al.  Verifying Probabilistic Procedural Programs , 2004, FSTTCS.

[20]  Robert Krauthgamer,et al.  Navigating nets: simple algorithms for proximity search , 2004, SODA '04.

[21]  Kunal Talwar.  Bypassing the Embedding: Approximation schemes and Compact Representations for Low Dimensional Metrics , 2004 .

[22]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[23]  Kunal Talwar,et al.  Bypassing the embedding: algorithms for low dimensional metrics , 2004, STOC '04.

[24]  Roger Wattenhofer,et al.  Unit disk graph approximation , 2004, DIALM-POMC '04.

[25]  Rajiv Gandhi,et al.  Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks , 2004, FSTTCS.

[26]  Jon M. Kleinberg,et al.  Triangulation and embedding using small sets of beacons , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[27]  Roger Wattenhofer,et al.  Maximal independent sets in radio networks , 2005, PODC '05.

[28]  Roger Wattenhofer,et al.  On the locality of bounded growth , 2005, PODC '05.