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

Abstract. 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.

• Type: Conference
• Year: 2005
• Where: WDAG
• Authors: Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer
• Keywords: Algorithms, Deterministic Polylogarithmic Algorithm, Maximal Independent Set, Time Randomized Algorithm, WDAG 2005