Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs (2005)
Cached
Download Links
- [www.distcomp.ethz.ch]
- [www.distcomp.ethz.ch]
- [distcomp.ethz.ch]
- [www.research.microsoft.com]
- [www.research.microsoft.com]
- [dcg.ethz.ch]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [disco.ethz.ch]
- [www.dcg.ethz.ch]
- [disco.ethz.ch]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. 19TH CONFERENCE ON DISTRIBUTED COMPUTING (DISC |
| Citations: | 32 - 10 self |
BibTeX
@INPROCEEDINGS{Kuhn05fastdeterministic,
author = {Fabian Kuhn and Thomas Moscibroda and Tim Nieberg and Roger Wattenhofer},
title = {Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs},
booktitle = {IN PROC. 19TH CONFERENCE ON DISTRIBUTED COMPUTING (DISC},
year = {2005},
pages = {273--287},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 \Delta * log*n) in graphs with bounded growth, where n and \Delta denote the number of nodes and the maximal degree in G, respectively.
