{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:49Z","timestamp":1725512149676},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72951-8_6","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T20:03:25Z","timestamp":1183320205000},"page":"51-65","source":"Crossref","is-referenced-by-count":8,"title":["Graph Searching with Advice"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Nisse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Soguet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., et al.: Capture of an intruder by mobile agents. In: 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 200\u2013209 (2002)","DOI":"10.1145\/564870.564906"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-39890-5_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. Barri\u00e8re","year":"2003","unstructured":"Barri\u00e8re, L., et al.: Connected and Internal Graph Searching. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 34\u201345. Springer, Heidelberg (2003)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., et al.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation\u00a0176, 1\u201321 (2002)","journal-title":"Information and Computation"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). In: DIMACS Ser. in Discrete Mathematics and Theoretical Computer Science, vol.\u00a05, pp. 33\u201349 (1991)","DOI":"10.1090\/dimacs\/005\/02"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11780823_7","volume-title":"Structural Information and Communication Complexity","author":"L. Blin","year":"2006","unstructured":"Blin, L., et al.: Distributing Chasing of Network Intruders. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 70\u201384. Springer, Heidelberg (2006)"},{"issue":"5","key":"6_CR7","first-page":"72","volume":"VI","author":"R. Breisch","year":"1967","unstructured":"Breisch, R.: An intuitive approach to speleotopology. Southwestern Cavers\u00a0VI(5), 72\u201378 (1967)","journal-title":"Southwestern Cavers"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F. Fich","year":"2003","unstructured":"Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing\u00a016, 121\u2013163 (2003)","journal-title":"Distributed Computing"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Luccio, F.L., Song, L.: Decontamination of chordal rings and tori. In: Proc. of 8th Workshop on Advances in Parallel and Distributed Computational Models (APDCM) (2006)","DOI":"10.1109\/IPDPS.2006.1639545"},{"key":"6_CR11","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous search in the hypercube for capturing an intruder. In: Proc. of 18th IEEE Int. Parallel and Distributed Processing Symp (IPDPS) (2005)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle Size: a New Measure of Difficulty for Communication Tasks. In: 25th Annual ACM Symp. on Principles of Distributed Computing (PODC), pp. 179\u2013187 (2006)","DOI":"10.1145\/1146381.1146410"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/11821069_2","volume-title":"Mathematical Foundations of Computer Science 2006","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree Exploration with an Oracle. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 24\u201337. Springer, Heidelberg (2006)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/11682462_45","volume-title":"LATIN 2006: Theoretical Informatics","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Nisse, N.: Connected Treewidth and Connected Graph Searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 470\u2013490. Springer, Heidelberg (2006)"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A. LaPaugh","year":"1993","unstructured":"LaPaugh, A.: Recontamination does not help to search a graph. Journal of the ACM\u00a040(2), 224\u2013245 (1993)","journal-title":"Journal of the ACM"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., et al.: The complexity of searching a graph. Journal of the ACM\u00a035(1), 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Nisse, N., Soguet, D.: Graph searching with advice. Technical Report LRI-1469, University Paris-Sud, France (March 2007)","DOI":"10.1007\/978-3-540-72951-8_6"},{"key":"6_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and Applications of Graphs","author":"T. Parson","year":"1978","unstructured":"Parson, T.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, vol.\u00a0642, pp. 426\u2013441. Springer, Heidelberg (1978)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P. Seymour","year":"1993","unstructured":"Seymour, P., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B.\u00a058, 22\u201333 (1993)","journal-title":"J. Combin. Theory Ser. B."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1007\/978-3-540-30551-4_77","volume-title":"Algorithms and Computation","author":"B. Yang","year":"2004","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping Graphs with Large Clique Number. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 908\u2013920. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T18:37:06Z","timestamp":1587667026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729181","9783540729518"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}