Abstract
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that graphs generated this way have fairly large dominating sets (i.e. linear in the size of the graph). On the other hand, we present efficient strategies to construct small dominating sets.
The algorithmic results represent an application of a particular analysis technique which can be used to characterise the asymptotic behaviour of a number of dynamic processes related to the web.
The first two authors were partially supported by a Royal Society Grant under the European Science Exchange Programme.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N., Spencer, J.H., Erdős, P.: The Probabilistic Method. John Wiley & Sons, Chichester (1992)
Alzoubi, K., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proc. 3rd ACM Internat. Symp. on Mobile Ad-hoc Networking & Computing, pp. 157–164 (2002)
Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bender, E.A., Canfield, E.R.: The asymptotic number of labeled graphs with given degree sequences. JCT A 24, 296–307 (1978)
Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. RSA 18, 279–290 (2001)
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. In: Proc. 9th WWW, pp. 309–320 (2000)
Cockayne, E., Goodman, S., Hedetniemi, S.: A linear algorithm for the domination number of a tree. IPL 4, 41–44 (1975)
Cooper, C.: The age specific degree distribution of web-graphs. Combinatorics Probability and Computing (Submitted) (2002)
Cooper, C., Frieze, A.: A general model of web graphs. RSA 22, 311–335 (2003)
Duckworth, W., Zito, M.: Sparse hypercube 3-spanners. DAM 103, 289–295 (2000)
Eidenbenz, S.: Online dominating set and variations on restricted graph classes. Technical Report 380, Department of Computer Science, ETH Zürich (2002)
Feige, U.: A threshold of ln n for approximating set cover. J.ACM 45, 634–652 (1998)
Garey, M.R., Johnson, D.S.: Strong NP-Completeness results: Motivation, examples, and implications. Journal of the Association for Computing Machinery 25(3), 499–508 (1978)
Harary, F., Haynes, T.W.: Double domination in graphs. Ars Comb. 55, 201–213 (2000)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
King, G.-H., Tzeng, W.-G.: On-line algorithms for the dominating set problem. IPL 61, 11–14 (1997)
Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. IPL 89, 75–83 (2004)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: The web as a graph. In: Proc. ACM Symp. on PODS, pp. 1–10 (2000)
Levene, M., Wheeldon, R.: Web dynamics. Software Focus 2, 31–38 (2001)
Liao, C.-S., Chang, G.J.: k-tuple domination in graphs. IPL 87, 45–50 (2003)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel and Dist. Systems 13, 14–25 (2002)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393(4), 440–442 (1998)
Wieland, B., Godbole, A.P.: On the domination number of a random graph. Elec. J. Combinat. 8:# R37 (2001)
Wormald, N.C.: The differential equation method for random graph processes and greedy algorithms. In: Karoński, M., Prömel, H.J. (eds.) Lectures on Approximation and Randomized Algorithms, pp. 73–155, PWN, Warsaw (1999)
Zito, M.: Greedy algorithms for minimisation problems in random regular graphs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 524–536. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cooper, C., Klasing, R., Zito, M. (2004). Dominating Sets in Web Graphs. In: Leonardi, S. (eds) Algorithms and Models for the Web-Graph. WAW 2004. Lecture Notes in Computer Science, vol 3243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30216-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-30216-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23427-2
Online ISBN: 978-3-540-30216-2
eBook Packages: Springer Book Archive