Lower bounds and algorithms for dominating sets in web graphs

Internet Mathematics

Volumn 2, Issue 3, 2005, Pages 275-300

  Cooper, Colin ^a   Klasing, Ralf ^b   Zito, Michele ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38549083508     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129105     Document Type: Article

References (26)

1. N. Alon, J. H. Spencer, and P. Erdős. The Probabilistic Method. New York: John Wiley & Sons, 1992.
2. K. Alzoubi, P. J. Wan, and O. Frieder. “Message-Optimal Connected Dominating Sets in Mobile ad hoc Networks.” In Proceedings of the 3rd International Symposium on Mobile ad hoc Networking & Computing, pp. 157–164. New York: ACM Press, 2002.
3. A. Barabási and R. Albert. “Emergence of Scaling in Random Networks.” Science 286 (1999), 509–512.
4. E. A. Bender and E. R. Canfield. “The Asymptotic Number of Labeled Graphs with Given Degree Sequences.” Journal of Combinatorial Theory A 24 (1978), 296–307.
5. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády. “The Degree Sequence of a Scale-Free Random Graph Process.” Random Structures and Algorithms 18 (2001), 279–290.
6. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. “Graph Structure in the Web.” Computer Networks 33:1–6 (2000), 309–320.
7. E. Cockayne, S. Goodman, and S. Hedetniemi. “A Linear Algorithm for the Domination Number of a Tree.” Information Processing Letters 4 (1975), 41–44.
8. C. Cooper. “The Age Specific Degree Distribution of Web-Graphs.” Submitted to Combinatorics Probability and Computing, 2002.
9. C. Cooper and A. Frieze. “A General Model of Web Graphs.” Random Structures and Algorithms 22 (2003), 311–335.
10. W. Duckworth and M. Zito. “Sparse Hypercube 3-Spanners.” Discrete Applied Mathematics 103 (2000), 289–295.
11. S. Eidenbenz. “Online Dominating Set and Variations on Restricted Graph Classes.” Technical Report 380, Department of Computer Science, ETH Zürich, 2002.
12. U. Feige. “A Threshold of ln n for Approximating Set Cover.” Journal of the ACM 45 (1998), 634–652.
13. M. R. Garey and D. S. Johnson. “Strong NP-Completeness Results: Motivation, Examples, and Implications.” Journal of the ACM 25:3 (1978), 499–508.
14. F. Harary and T. W. Haynes. “Double Domination in Graphs.” Ars Comb. 55 (2000), 201–213.
15. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, editors. Domination in Graphs: Advanced Topics. New York: Marcel Dekker, 1998.
16. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. New York: Marcel Dekker, 1998.
17. G.-H. King and W.-G. Tzeng. “On-Line Algorithms for the Dominating Set Problem.” Information Processing Letters 61 (1997), 11–14.
18. R. Klasing and C. Laforest. “Hardness Results and Approximation Algorithms of k-tuple Domination in Graphs.” IPL 89 (2004), 75–83.
19. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. “The Web as a Graph.” In Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 1–10. New York: ACM Press, 2000.
20. M. Levene and R. Wheeldon. “Web Dynamics.” Software Focus 2 (2001), 31–38.
21. C.-S. Liao and G. J. Chang. “k-Tuple Domination in Graphs.” Information Processing Letters 87 (2003), 45–50.
22. I. Stojmenovic, M. Seddigh, and J. Zunic. “Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks.” IEEE Trans. Parallel and Dist. Systems 13 (2002), 14–25.
23. D. J. Watts and S. H. Strogatz. “Collective Dynamics of ‘Small-World’ Networks.” Nature 393:4 (June 1998), 440–442.
24. B. Wieland and A. P. Godbole. “On the Domination Number of a Random Graph.” Elec. J. Combinat. 8 (2001), R37.
25. N. C. Wormald. “The Differential Equation Method for Random Graph Processes and Greedy Algorithms.” In Lectures on Approximation and Randomized Algorithms, edited byM. Karoński and H. J. Prömel, pp. 73–155. Warsaw: PWN, 1999.
26. M. Zito. “Greedy Algorithms for Minimisation Problems in Random Regular Graphs.” In Algorithms—ESA 2001: 9th Annual European Symposium, Aurhus, Denmark, August 28–31, 2001, Procdeedings, Lecture Notes in Computer Science 2161, edited by F. Meyer auf der Heide, pp. 524–536. New York: Springer-Verlag, 2001.