{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:25:21Z","timestamp":1758273921005},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T00:00:00Z","timestamp":1430352000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00373-015-1579-5","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T11:51:11Z","timestamp":1430308271000},"page":"559-581","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Network Decontamination with a Single Agent"],"prefix":"10.1007","volume":"32","author":[{"given":"Yassine","family":"Daadaa","sequence":"first","affiliation":[]},{"given":"Asif","family":"Jamshed","sequence":"additional","affiliation":[]},{"given":"Mudassir","family":"Shabbir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"key":"1579_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Mehrabian, A.: Chasing a fast robber on planar graphs and random graphs. J. Graph Theory (2014)","DOI":"10.1002\/jgt.21791"},{"key":"1579_CR2","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 200\u2013209. ACM (2002)","DOI":"10.1145\/564870.564906"},{"issue":"1","key":"1579_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0097-3165(91)90021-8","volume":"56","author":"B Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Compressions and isoperimetric inequalities. J Comb. Theory Ser. A 56(1), 47\u201362 (1991)","journal-title":"J Comb. Theory Ser. A"},{"issue":"4","key":"1579_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF01275667","volume":"11","author":"B Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Edge-isoperimetric inequalities in the grid. Combinatorica 11(4), 299\u2013314 (1991)","journal-title":"Combinatorica"},{"issue":"5","key":"1579_CR5","first-page":"72","volume":"6","author":"R Breisch","year":"1967","unstructured":"Breisch, R.: An intuitive approach to speleotopology. Southwest Cavers 6(5), 72\u201378 (1967)","journal-title":"Southwest Cavers"},{"issue":"4","key":"1579_CR6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0402041","volume":"2","author":"F Chung","year":"1989","unstructured":"Chung, F.: Pebbling in hypercubes. SIAM J. Discrete Math. 2(4), 467\u2013472 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"1579_CR7","unstructured":"Daadaa, Y.: Network Decontamination with temporal immunity. Ph.D. thesis, University of Ottawa (2012)"},{"key":"1579_CR8","doi-asserted-by":"crossref","unstructured":"Daadaa, Y., Flocchini, P., Zaguia, N.: Network decontamination with temporal immunity by cellular automata. In Cellular Automata, pp. 287\u2013299. Springer (2010)","DOI":"10.1007\/978-3-642-15979-4_31"},{"key":"1579_CR9","doi-asserted-by":"crossref","unstructured":"Daadaa, Y., Flocchini, P., Zaguia, N.: Decontamination with temporal immunity by mobile cellular automata. In International Conference on Scientific Computing (CSC), pp. 172\u2013178 (2011)","DOI":"10.1007\/978-3-642-15979-4_31"},{"key":"1579_CR10","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"issue":"2","key":"1579_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0603022","volume":"3","author":"HN Djidjev","year":"1982","unstructured":"Djidjev, H.N.: On the problem of partitioning planar graphs. SIAM J. Algebr. Discrete Methods 3(2), 229\u2013240 (1982)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"1579_CR12","unstructured":"Flocchini, Paola, F.L., Song, L.X.: Size optimal strategies for capturing an intruder in mesh networks. In Proceedings of the International Conference on Communications in Computing (CIC), pp. 200\u2013206, Las Vegas, USA, (2005)"},{"key":"1579_CR13","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Tree decontamination with temporary immunity. In Algorithms and Computation, pp. 330\u2013341. Springer (2008)","DOI":"10.1007\/978-3-540-92182-0_31"},{"key":"1579_CR14","unstructured":"Kahn, J.: Personal communication (2013)"},{"issue":"1","key":"1579_CR15","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1006\/jagm.1998.0972","volume":"30","author":"S Kutten","year":"1999","unstructured":"Kutten, S., Peleg, D.: Fault-local distributed mending. J Algorithms 30(1), 144\u2013165 (1999)","journal-title":"J Algorithms"},{"issue":"1","key":"1579_CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/S0097539797319109","volume":"30","author":"S Kutten","year":"2000","unstructured":"Kutten, S., Peleg, D.: Tight fault locality. SIAM J. Comput. 30(1), 247\u2013268 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1579_CR17","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"AS Paugh La","year":"1993","unstructured":"La Paugh, A.S.: Recontamination does not help to search a graph. J. ACM 40(2), 224\u2013245 (1993)","journal-title":"J. ACM"},{"issue":"2","key":"1579_CR18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"J Richard","year":"1979","unstructured":"Richard, J.: Lipton and Robert Endre Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"1579_CR19","unstructured":"Luccio, F., Pagli, L., Santoro, N.: Network decontamination with local immunization. In: Proceedings of the 20th International Conference on Parallel and Distributed Processing, pp. 264\u2013264. IEEE Computer Society (2006)"},{"issue":"1","key":"1579_CR20","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J ACM 35(1), 18\u201344 (1988)","journal-title":"J ACM"},{"key":"1579_CR21","doi-asserted-by":"crossref","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. theory and applications of graphs. Lecture Notes in Mathematics, pp. 426\u2013441. Springer-Verlag (1976)","DOI":"10.1007\/BFb0070400"},{"key":"1579_CR22","unstructured":"Parsons, T.D.: The search number of a connected graph. In: Proceedings of the 9th South-Eastern Conference on Combinatorics, Graph Theory, and Computing, pp. 549\u2013554 (1978)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1579-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1579-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1579-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T14:03:29Z","timestamp":1651845809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1579-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,30]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["1579"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1579-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,30]]}}}