EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

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

Home Policy Brochure Browse Search User Area Contact Help

Kuhn, F. and Moscibroda, T. and Nieberg, T. and Wattenhofer, R. (2005) Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In: Distributed Computing: 19th International Conference, DISC 2005, 26-29 Sep 2005, Cracow, Poland. pp. 273-283. Lecture Notes in Computer Science 3724. Springer-Verlag. ISBN 3-540-29163-6

Full text available as:

PDF (Full Paper)

271 Kb

Official URL: http://dx.doi.org/10.1007/11561927_21

Abstract

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.

Item Type:	Conference or Workshop Paper (Full Paper, Talk)
Research Group:	EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:	CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication
Research Project:	Embedded WiSeNts: Wireless Sensor Networks -- Omnipresent Embedded Systems for Exploration and Control, Smart Surroundings
ID Code:	1686
Status:	Published
Deposited On:	05 May 2006
Refereed:	Yes
International:	Yes
More Information:	statistics metis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item