Abstract
Information gathering by crawlers on the web is of practical interest. We consider a simplified model for crawling complex networks such as the web graph, which is a variation of the robot vacuum edge-cleaning process of Messinger and Nowakowski. In our model, a crawler visits nodes via a deterministic walk determined by their weightings which change during the process deterministically. The minimum, maximum, and average time for the robot crawler to visit all the nodes of a graph is considered on various graph classes such as trees, multi-partite graphs, binomial random graphs, and graphs generated by the preferential attachment model.
Research supported by grants from NSERC, MITACS Inc. and Ryerson University.
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
Aiello, W., Bonato, A., Cooper, C., Janssen, J., Prałat, P.: A spatial web graph model with local influence regions. Internet Math. 5, 175–196 (2009)
Alon, N., Prałat, P., Wormald, N.: Cleaning regular graphs with brushes. SIAM J. Discrete Math. 23, 233–250 (2008)
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press, Princeton (2007)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5–34 (2004)
Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18, 279–290 (2001)
Bonato, A., Janssen, J., Prałat, P.: Geometric protean graphs. Internet Math. 8, 2–28 (2012)
Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)
Bradonjić, M., Hagberg, A., Percus, A.: The structure of geographical threshold graphs. Internet Math. 5, 113–140 (2008)
Brin, S., Page, L.: Anatomy of a large-scale hypertextual web search engine. In: Proceedings of the 7th International World Wide Web Conference (1998)
Chung, F., Lu, L.: Complex Graphs and Networks. American Mathematical Society, Boston (2006)
Cooper, C., Frieze, A., Prałat, P.: Some typical properties of the spatial preferred attachment model. Internet Math. 10, 27–47 (2014)
Cooper, C., Ilcinkas, D., Klasing, R., Kosowski, A.: Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24, 91–99 (2011)
Cooper, C., Prałat, P.: Scale free graphs of increasing degree. Random Struct. Algorithms 38, 396–421 (2011)
Gajardo, A., Moreira, A., Goles, E.: Complexity of Langton’s ant. Discrete Appl. Math. 117, 41–50 (2002)
Henzinger, M.R.: Algorithmic challenges in web search engines. Internet Math. 1, 115–126 (2004)
Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley, New York (2000)
Koenig, S., Szymanski, B., Liu, Y.: Efficient and inefficient ant coverage methods. Ann. Math. Artif. Intell. 31, 41–76 (2001)
Komlós, J., Szemerédi, E.: Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Math. 43(1), 55–63 (1983)
Li, Z., Vetta, A.: Bounds on the cleaning times of robot vacuums. Oper. Res. Lett. 38(1), 69–71 (2010)
Malpani, N., Chen, Y., Vaidya, N.H., Welch, J.L.: Distributed token circulation in mobile ad hoc networks. IEEE Trans. Mob. Comput. 4, 154–165 (2005)
Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press, New York (2008)
Messinger, M.E., Nowakowski, R.J.: The Robot cleans up. J. Comb. Optim. 18(4), 350–361 (2009)
Messinger, M.E., Nowakowski, R.J., Prałat, P.: Cleaning a network with brushes. Theor. Comput. Sci. 399, 191–205 (2008)
Olston, C., Najork, M.: Web crawling. Found. Trends Inform. Retrieval 4(3), 175–246 (2010)
Pittel, B.: Note on the heights of random recursive trees and random \(m\)-ary search trees. Random Struct. Algorithms 5, 337–347 (1994)
Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Efficiently searching a graph by a smell-oriented vertex process. Ann. Math. Artif. Intell. 24, 211–223 (1998)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)
Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37, 165–186 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bonato, A. et al. (2015). The Robot Crawler Number of a Graph. In: Gleich, D., Komjáthy, J., Litvak, N. (eds) Algorithms and Models for the Web Graph. WAW 2015. Lecture Notes in Computer Science(), vol 9479. Springer, Cham. https://doi.org/10.1007/978-3-319-26784-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-26784-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26783-8
Online ISBN: 978-3-319-26784-5
eBook Packages: Computer ScienceComputer Science (R0)