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, 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.
|Name||Lecture Notes in Computer Science|
|Conference||Distributed Computing: 19th International Conference, DISC 2005|
|Period||26/09/05 → 29/09/05|
|Other||26-29 Sep 2005|
- EC Grant Agreement nr.: FP6/004400