{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:41Z","timestamp":1725521741576},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_31","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"330-341","source":"Crossref","is-referenced-by-count":10,"title":["Tree Decontamination with Temporary Immunity"],"prefix":"10.1007","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proc. 14th Symp. Parallel Algorithms and Architectures (SPAA 2002), pp. 200\u2013209 (2002)","DOI":"10.1145\/564870.564906"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Fraignaud, P., Santoro, N., Thilikos, D.: Searching is not jumping. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 34\u201345. Springer, Heidelberg (2003)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1090\/dimacs\/005\/02","volume":"5","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D.: Graph searching, path-width, tree-width and related problems. DIMACS Series in Disc. Maths. and Theo. Comp. Sci.\u00a05, 33\u201349 (1991)","journal-title":"DIMACS Series in Disc. Maths. and Theo. Comp. Sci."},{"key":"31_CR4","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. J. Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"issue":"1-2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2008.02.004","volume":"399","author":"L. Blin","year":"2008","unstructured":"Blin, L., Fraignaud, P., Nisse, N., Vial, S.: Distributed chasing of network intruders. Theoretical Computer Science\u00a0399(1-2), 12\u201337 (2008)","journal-title":"Theoretical Computer Science"},{"key":"31_CR6","first-page":"72","volume":"5","author":"R. Breisch","year":"1967","unstructured":"Breisch, R.: An intuitive approach to speleotopology. S.W. Cavers\u00a0 VI(5), 72\u201378 (1967)","journal-title":"S.W. Cavers"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J. Ellis","year":"1994","unstructured":"Ellis, J., Sudborough, H., Turner, J.: The vertex separation and search number of a graph. Information and Computation\u00a0113(1), 50\u201379 (1994)","journal-title":"Information and Computation"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Decontamination of hypercubes by mobile agents. Networks (to appear, 2008)","DOI":"10.1002\/net.20240"},{"issue":"3","key":"31_CR9","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1142\/S0129054107004838","volume":"18","author":"P. Flocchini","year":"2007","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Decontamination of chordal rings and tori using mobile agents. Int. J. of Foundation of Computer Science\u00a018(3), 547\u2013564 (2007)","journal-title":"Int. J. of Foundation of Computer Science"},{"key":"31_CR10","unstructured":"Flocchini, P., Luccio, F.L., Song, L.X.: Size optimal strategies for capturing an intruder in mesh networks. In: Proc. Int. Conf. on Comm. in Computing (CIC 2005), pp. 200\u2013206 (2005)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/11604655_17","volume-title":"Distributed Computing and Internet Technology","author":"P. Flocchini","year":"2005","unstructured":"Flocchini, P., Nayak, A., Shulz, A.: Cleaning an arbitrary regular network with mobile agents. In: Chakraborty, G. (ed.) ICDCIT 2005. LNCS, vol.\u00a03816, pp. 132\u2013142. Springer, Heidelberg (2005)"},{"key":"31_CR12","volume-title":"Mobile Agents in Networking and Distributed Computing","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Santoro, N.: Distributed Security Algorithms For Mobile Agents. In: Cao, J., Das, S. (eds.) Mobile Agents in Networking and Distributed Computing. Wiley, Chichester (2008)"},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1137\/S0895480199350477","volume":"13","author":"F. Fomin","year":"2000","unstructured":"Fomin, F., Golovach, P.: Graph searching and interval completion. SIAM J. on Discrete Mathematics\u00a013(4), 454\u2013464 (2000)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Fomin, F., Thilikos, D., Todineau, I.: Connected graph searching in outerplanar graphs. In: Proc. 7th Int. Conf. on Graph Theory (ICGT 2005) (2005)","DOI":"10.1016\/j.endm.2005.06.032"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","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. 479\u2013490. Springer, Heidelberg (2006)"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11917496_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Nisse, N.: Monotony properties of connected visible graph searching. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 229\u2013240. Springer, Heidelberg (2006)"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"L. Kirousis","year":"1985","unstructured":"Kirousis, L., Papadimitriou, C.: Interval graphs and searching. Discrete Mathematics\u00a055, 181\u2013184 (1985)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"31_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L. Kirousis","year":"1986","unstructured":"Kirousis, L., Papadimitriou, C.: Searching and pebbling. Theoretical Computer Science\u00a047(2), 205\u2013218 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"31_CR19","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. J. of the ACM\u00a040(2), 224\u2013245 (1993)","journal-title":"J. of the ACM"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Luccio, F.L.: Intruder capture in Sierpi\u0144ski graphs. In: Proc. 4th Int. Conf. on Fun with Algorithms, pp. 249\u2013261 (2007)","DOI":"10.1007\/978-3-540-72914-3_22"},{"issue":"3","key":"31_CR21","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0129054107004784","volume":"18","author":"F. Luccio","year":"2007","unstructured":"Luccio, F., Pagli, L., Santoro, N.: Network decontamination with local immunization. Int. J. of Foundation of Computer Science\u00a018(3), 457\u2013474 (2007)","journal-title":"Int. J. of Foundation of Computer Science"},{"issue":"1","key":"31_CR22","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. J. of the ACM\u00a035(1), 18\u201344 (1988)","journal-title":"J. of the ACM"},{"key":"31_CR23","series-title":"Lecture Notes in Mathematics","first-page":"426","volume-title":"Theory and Applications of Graphs","author":"T. Parson","year":"1976","unstructured":"Parson, T.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, pp. 426\u2013441. Springer, Heidelberg (1976)"},{"key":"31_CR24","volume-title":"Design and Analysis of Distributed Algorithms","author":"N. Santoro","year":"2007","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, Chichester (2007)"},{"issue":"2","key":"31_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(94)00160-K","volume":"137","author":"A. Takahashi","year":"1995","unstructured":"Takahashi, A., Ueno, S., Kajitani, Y.: Mixed searching and proper-path-width. Theoretical Computer Science\u00a0137(2), 253\u2013268 (1995)","journal-title":"Theoretical Computer Science"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BFb0055153","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Yamamoto","year":"1998","unstructured":"Yamamoto, M., Takahashi, K., Hagiya, M., Nishizaki, S.-Y.: Formalization of graph search algorithms and its applications. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol.\u00a01479, pp. 479\u2013496. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T03:44:30Z","timestamp":1557978270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}