An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm

Discrete Applied Mathematics

Volumn 157, Issue 9, 2009, Pages 2010-2014

  Cooper, Colin ^a   Zito, Michele ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Algorithms; Dominating sets; Random trees

Indexed keywords

BOOLEAN CIRCUITS; CARDINALITY; DOMINATING SETS; DOMINATION NUMBERS; INFORMATION PROCESSING; ISOLATED VERTICES; LINEAR ALGORITHMS; LINEAR TIME; MATHEMATICAL STATISTICS; MINIMUM DOMINATING SETS; POWER LAWS; RANDOM NETWORKS; RANDOM RECURSIVE TREES; RANDOM TREES;

ALGORITHMS; GRAPH THEORY; RECURSIVE FUNCTIONS; STATISTICS;

TREES (MATHEMATICS);

EID: 67349239810     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.06.024     Document Type: Article

References (14)

1. K. Alzoubi, P.J. Wan, O. Frieder, Message-optimal connected dominating sets in mobile ad hoc networks, in: Proc. 3rd ACM Internat. Symp. on Mobile Ad-hoc Networking & Computing, 2002, pp. 157-164
2. Barabási A., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
3. Bollobás B. Random Graphs (1985), Academic Press
4. Cockayne E., Goodman S., and Hedetniemi S. A linear algorithm for the domination number of a tree. Information Processing Letters 4 (1975) 41-44
5. Duckworth W., and Zito M. Sparse hypercube 3-spanners. DAM 103 (2000) 289-295
6. Feige U. A threshold of ln n for approximating set cover. JACM 45 (1998) 634-652
7. Garey M.R., and Johnson D.S. Strong NP-Completeness results: Motivation, examples, and implications. Journal of the Association for Computing Machinery 25 3 (1978) 499-508
8. In: Haynes T.W., Hedetniemi S.T., and Slater P.J. (Eds). Domination in Graphs: Advanced Topics (1998), Marcel Dekker
9. Haynes T.W., Hedetniemi S.T., and Slater P.J. Fundamentals of Domination in Graphs (1998), Marcel Dekker
10. McDiarmid C. On the method of bounded differences. In: Siemons J. (Ed). Surveys in Combinatorics 1989. LMS Lecture Note Series vol. 141 (1989), CUP 148-188
11. Smythe R., and Mahmoud H. A survey of recursive trees. Theory of Probability and Mathematical Statistics 51 (1996) 1-29
12. Stojmenovic I., Seddigh M., and Zunic J. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 13 (2002) 14-25
13. Wieland B., and Godbole A.P. On the domination number of a random graph. The Electronic Journal of Combinatorics 8 (2001) # R37
14. Zito M. Greedy algorithms for minimisation problems in random regular graphs. Proc 9th ESA. LNCS vol. 2161 (2001), Springer-Verlag 524-536