A distributed algorithm to find k-dominating sets

Authors:
Lucia Draque Penso;Valmir C. Barbosa
Affiliations:
Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972, Rio de Janeiro, RJ, Brazil and Computer Science Department, ...;Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972, Rio de Janeiro, RJ, Brazil
Venue:
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Year:
2004

Citing 10
Cited 6

Parallel symmetry-breaking in sparse graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
Distributed data structures: a complexity-oriented view

Proceedings of the 4th international workshop on Distributed algorithms
Improved distributed algorithms for coloring and network decomposition problems

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
How to allocate network centers

Journal of Algorithms
An introduction to distributed algorithms

An introduction to distributed algorithms
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

SIAM Journal on Computing
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Multicast communication: protocols and applications

Multicast communication: protocols and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Fast deterministic distributed algorithms for sparse spanners

Theoretical Computer Science
An efficient distributed algorithm for canonical labeling on directed split-stars

Discrete Applied Mathematics
Best-effort group service in dynamic networks

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The south zone: distributed algorithms for alliances

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Fast deterministic distributed algorithms for sparse spanners

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Time-bounded essential localization for wireless sensor networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a connected undirected graph G(n,m) with n nodes and m edges. A k-dominating set D in G is a set of nodes having the property that every node in G is at most k edges away from at least one node in D. Finding a k-dominating set of minimum size is NP-hard. We give a new synchronous distributed algorithm to find a k-dominating set in G of size no greater than [n/(k+1)]. Our algorithm requires O(k log* n) time and O(m log k+n log k log* n) messages to run. It has the same time complexity as the best currently known algorithm, but improves on that algorithm's message complexity and is, in addition, conceptually simpler.