{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:36:21Z","timestamp":1725842181590},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319267838"},{"type":"electronic","value":"9783319267845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26784-5_11","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T05:07:47Z","timestamp":1449637667000},"page":"132-147","source":"Crossref","is-referenced-by-count":2,"title":["The Robot Crawler Number of a Graph"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[]},{"given":"Rita M.","family":"del R\u00edo-Chanona","sequence":"additional","affiliation":[]},{"given":"Calum","family":"MacRury","sequence":"additional","affiliation":[]},{"given":"Jake","family":"Nicolaidis","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"P\u00e9rez-Gim\u00e9nez","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[]},{"given":"Kirill","family":"Ternovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/15427951.2008.10129305","volume":"5","author":"W Aiello","year":"2009","unstructured":"Aiello, W., Bonato, A., Cooper, C., Janssen, J., Pra\u0142at, P.: A spatial web graph model with local influence regions. Internet Math. 5, 175\u2013196 (2009)","journal-title":"Internet Math."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1137\/070703053","volume":"23","author":"N Alon","year":"2008","unstructured":"Alon, N., Pra\u0142at, P., Wormald, N.: Cleaning regular graphs with brushes. SIAM J. Discrete Math. 23, 233\u2013250 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press, Princeton (2007)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5\u201334 (2004)","journal-title":"Combinatorica"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18, 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/15427951.2012.625246","volume":"8","author":"A Bonato","year":"2012","unstructured":"Bonato, A., Janssen, J., Pra\u0142at, P.: Geometric protean graphs. Internet Math. 8, 2\u201328 (2012)","journal-title":"Internet Math."},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/15427951.2008.10129304","volume":"5","author":"M Bradonji\u0107","year":"2008","unstructured":"Bradonji\u0107, M., Hagberg, A., Percus, A.: The structure of geographical threshold graphs. Internet Math. 5, 113\u2013140 (2008)","journal-title":"Internet Math."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: Anatomy of a large-scale hypertextual web search engine. In: Proceedings of the 7th International World Wide Web Conference (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/107","volume-title":"Complex Graphs and Networks","author":"F Chung","year":"2006","unstructured":"Chung, F., Lu, L.: Complex Graphs and Networks. American Mathematical Society, Boston (2006)"},{"key":"11_CR12","first-page":"27","volume":"10","author":"C Cooper","year":"2014","unstructured":"Cooper, C., Frieze, A., Pra\u0142at, P.: Some typical properties of the spatial preferred attachment model. Internet Math. 10, 27\u201347 (2014)","journal-title":"Internet Math."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00446-011-0138-4","volume":"24","author":"C Cooper","year":"2011","unstructured":"Cooper, C., Ilcinkas, D., Klasing, R., Kosowski, A.: Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24, 91\u201399 (2011)","journal-title":"Distributed Comput."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1002\/rsa.20318","volume":"38","author":"C Cooper","year":"2011","unstructured":"Cooper, C., Pra\u0142at, P.: Scale free graphs of increasing degree. Random Struct. Algorithms 38, 396\u2013421 (2011)","journal-title":"Random Struct. Algorithms"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0166-218X(00)00334-6","volume":"117","author":"A Gajardo","year":"2002","unstructured":"Gajardo, A., Moreira, A., Goles, E.: Complexity of Langton\u2019s ant. Discrete Appl. Math. 117, 41\u201350 (2002)","journal-title":"Discrete Appl. Math."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/15427951.2004.10129079","volume":"1","author":"MR Henzinger","year":"2004","unstructured":"Henzinger, M.R.: Algorithmic challenges in web search engines. Internet Math. 1, 115\u2013126 (2004)","journal-title":"Internet Math."},{"key":"11_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, New York (2000)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1016665115585","volume":"31","author":"S Koenig","year":"2001","unstructured":"Koenig, S., Szymanski, B., Liu, Y.: Efficient and inefficient ant coverage methods. Ann. Math. Artif. Intell. 31, 41\u201376 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J Koml\u00f3s","year":"1983","unstructured":"Koml\u00f3s, J., Szemer\u00e9di, E.: Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Math. 43(1), 55\u201363 (1983)","journal-title":"Discrete Math."},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.orl.2009.09.002","volume":"38","author":"Z Li","year":"2010","unstructured":"Li, Z., Vetta, A.: Bounds on the cleaning times of robot vacuums. Oper. Res. Lett. 38(1), 69\u201371 (2010)","journal-title":"Oper. Res. Lett."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1109\/TMC.2005.25","volume":"4","author":"N Malpani","year":"2005","unstructured":"Malpani, N., Chen, Y., Vaidya, N.H., Welch, J.L.: Distributed token circulation in mobile ad hoc networks. IEEE Trans. Mob. Comput. 4, 154\u2013165 (2005)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"11_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press, New York (2008)"},{"issue":"4","key":"11_CR23","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s10878-009-9236-7","volume":"18","author":"ME Messinger","year":"2009","unstructured":"Messinger, M.E., Nowakowski, R.J.: The Robot cleans up. J. Comb. Optim. 18(4), 350\u2013361 (2009)","journal-title":"J. Comb. Optim."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.tcs.2008.02.037","volume":"399","author":"ME Messinger","year":"2008","unstructured":"Messinger, M.E., Nowakowski, R.J., Pra\u0142at, P.: Cleaning a network with brushes. Theor. Comput. Sci. 399, 191\u2013205 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1561\/1500000017","volume":"4","author":"C Olston","year":"2010","unstructured":"Olston, C., Najork, M.: Web crawling. Found. Trends Inform. Retrieval 4(3), 175\u2013246 (2010)","journal-title":"Found. Trends Inform. Retrieval"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/rsa.3240050207","volume":"5","author":"B Pittel","year":"1994","unstructured":"Pittel, B.: Note on the heights of random recursive trees and random $$m$$ m -ary search trees. Random Struct. Algorithms 5, 337\u2013347 (1994)","journal-title":"Random Struct. Algorithms"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018957401093","volume":"24","author":"IA Wagner","year":"1998","unstructured":"Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Efficiently searching a graph by a smell-oriented vertex process. Ann. Math. Artif. Intell. 24, 211\u2013223 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR28","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V Yanovski","year":"2003","unstructured":"Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37, 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26784-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T06:44:36Z","timestamp":1599893076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26784-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319267838","9783319267845"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26784-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}