Abstract
A subset of the vertices of a graph is a dominating set if every vertex not in the subset is adjacent to at least one vertex in this subset. Dominating sets are widely used for clustering and routing in ad hoc wireless networks. In this chapter, we describe sample sequential, distributed, and self-stabilizing dominating set algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233–235
Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
Goddard W, Srimani P (2010) Anonymous self-stabilizing distributed algorithms for connected dominating set in a network graph. In: Proc the international multi-conference on complexity, informatics and cybernetics (IMCIC)
Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374–387
Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Dekker, New York
Hedetniemi SM, Hedetniemi ST, Jacobs DP, Srimani PK (2003) Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Comput Math Appl 46(5–6):805–811
Jain A, Gupta A (2005) A distributed self-stabilizing algorithm for finding a connected dominating set in a graph. In: Proc PDCAT. IEEE Computer Society, Los Alamitos, pp 615–619
Kamei S, Kakugawa H (2007) A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: IPDPS. IEEE Press, New York, pp 1–8
Karp RM (1991) Probabilistic recurrence relations. In: Proc 23rd annual ACM symposium on theory of computing (STOC 91), pp 190–197
Wattenhofer R Principles of distributed computing, Chapter 12. Class notes, ETH Zurich
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Erciyes, K. (2013). Dominating Sets. In: Distributed Graph Algorithms for Computer Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-4471-5173-9_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5173-9_11
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5172-2
Online ISBN: 978-1-4471-5173-9
eBook Packages: Computer ScienceComputer Science (R0)