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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kühn, F., Moscibroda, T., Nieberg, T., & Wattenhofer, R. (2005). Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3724 LNCS, pp. 273–287). Springer Verlag. https://doi.org/10.1007/11561927_21
Mendeley helps you to discover research relevant for your work.