Abstract
A weakly-connected dominating set, \( \mathcal{W} \), of a graph, G, is a dominating set such that the subgraph consisting of V(G) and all edges incident with vertices in \( \mathcal{W} \) is connected. Finding a small weakly-connected dominating set of a graph has important applications in clustering mobile ad-hoc networks. In this paper we introduce several new randomised greedy algorithms for finding small weakly-connected dominating sets of regular graphs. These heuristics proceed by growing a weakly-connected dominating set in the graph. We analyse the average-case performance of the simplest such heuristic on random regular graphs using differential equations. This introduces upper bounds on the size of a smallest weakly-connected dominating set of a random regular graph. We then show that for random regular graphs, other “growing” greedy strategies have exactly the same average-case performance as the simple heuristic.
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
Preview
Unable to display preview. Download preview PDF.
References
Alon, N.: Transversal Numbers of Uniform Hypergraphs. Graphs and Combinatorics 6(1) (1990) 1–4
Bollobás, B.: Random Graphs. Academic Press, London (1985)
Caro, T., West, D.B. and Yuster, R.: Connected Domination and Spanning Trees with Many Leaves. SIAM Journal on Discrete Mathematics 13(2) (2000) 202–211
Chen, Y.P. and Liestman, A.L.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad-Hoc Networks. In: Proceedings of 3rd ACM International Symposium on Mobile Ad-Hoc Networking and Computing. ACM press (2002), 165–172
Diestel, R.: Graph Theory. Springer-Verlag (1997)
Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J. and Srinivasan, A.: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (2003) 717–724
Dunbar, J.E., Grossman, J.W., Hattingh, J.H., Hedetniemi, S.T. and McRae, A.A.: On Weakly-Connected Domination in Graphs. Discrete Mathematics 167/168 (1997) 261–269
Garey, M.R. and Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company (1979)
Grossman, J.W.: Dominating Sets whose Closed Stars form Spanning Trees. Discrete Mathematics 169(1–3) (1997) 83–94
Guha, S. and Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20 (1998) 374–387
Haynes, T.W., Hedetniemi, S.T. and Slater, P.J.: Domination in Graphs: Advanced topics. Marcel Dekker, New York (1998)
Lovász, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics 13(4) (1975) 383–390
Wormald, N.C.: Models of Random Regular Graphs. In: Surveys in Combinatorics. Cambridge University Press, (1999) 239–298
Wormald, N.C.: The Differential Equation Method for Random Graph Processes and Greedy Algorithms. In: M. Karoński and H.-J. Prömel (editors), Lectures on Approximation and Randomized Algorithms. PWN Warsaw (1999) 73–155
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duckworth, W., Mans, B. (2003). Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_15
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive