{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:43Z","timestamp":1759638583829},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T00:00:00Z","timestamp":1253577600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00446-009-0089-1","type":"journal-article","created":{"date-parts":[[2009,9,21]],"date-time":"2009-09-21T11:23:52Z","timestamp":1253532232000},"page":"117-127","source":"Crossref","is-referenced-by-count":26,"title":["The cost of monotonicity in distributed graph searching"],"prefix":"10.1007","volume":"22","author":[{"given":"David","family":"Ilcinkas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Soguet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,22]]},"reference":[{"key":"89_CR1","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 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 200\u2013209, 2002","DOI":"10.1145\/564870.564906"},{"key":"89_CR2","unstructured":"Barri\u00e8re, L., Fraigniaud, P., Santoro, N., Thilikos, D.M.: Searching is not jumping. In: Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Number 2880 in LNCS, pp. 34\u201345, 2003"},{"key":"89_CR3","doi-asserted-by":"crossref","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 (a survey). DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 5, 33\u201349 (1991)","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"issue":"2","key":"89_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock D., Seymour P.D.: Monotonicity in graph searching. J. Algorithms 12(2), 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"89_CR5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2008.02.004","volume":"399","author":"L. Blin","year":"2008","unstructured":"Blin L., Fraigniaud P., Nisse N., Vial S.: Distributed chasing of network intruders. Theor. Comput. Sci. 399(1\u20132), 12\u201337 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"89_CR6","first-page":"72","volume":"6","author":"R.L. Breisch","year":"1967","unstructured":"Breisch R.L.: An intuitive approach to speleotopology. Southwestern Cavers 6, 72\u201378 (1967)","journal-title":"Southwestern Cavers"},{"issue":"3","key":"89_CR7","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1142\/S0129054107004838","volume":"18","author":"P. Flocchini","year":"2007","unstructured":"Flocchini P., Huang M.J., Luccio F.L.: Decontaminating chordal rings and tori using mobile agents. Int. J. Found. Comput. Sci. 18(3), 547\u2013563 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"89_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.20240","volume":"52","author":"P. Flocchini","year":"2008","unstructured":"Flocchini P., Huang M.J., Luccio F.L.: Decontamination of hypercubes by mobile agents. Networks 52(3), 167\u2013178 (2008)","journal-title":"Networks"},{"key":"89_CR9","unstructured":"Flocchini, P., Luccio, F.L., Song, L.X.: Size optimal strategies for capturing an intruder in mesh networks. In: Proceedings of the 2005 International Conference on Communications in Computing (CIC), pp. 200\u2013206, 2005"},{"issue":"3","key":"89_CR10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin F.V., Thilikos D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"89_CR11","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Nisse, N.: Connected treewidth and connected graph searching. In: Proceedings of the 7th Latin American Symposium (LATIN), Number 3887 in LNCS, pp. 479\u2013490, 2006","DOI":"10.1007\/11682462_45"},{"issue":"12","key":"89_CR12","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1016\/j.ic.2008.09.002","volume":"206","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud P., Nisse N.: Monotony properties of connected visible graph searching. Inf. Comput. 206(12), 1383\u20131393 (2008)","journal-title":"Inf. Comput."},{"issue":"2","key":"89_CR13","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A.S. LaPaugh","year":"1993","unstructured":"LaPaugh A.S.: Recontamination does not help to search a graph. J. ACM 40(2), 224\u2013245 (1993)","journal-title":"J. ACM"},{"key":"89_CR14","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/s00224-008-9116-z","volume":"44","author":"F.L. Luccio","year":"2009","unstructured":"Luccio F.L.: Contiguous search problem in Sierpinski graphs. Theory Comput Syst 44, 186\u2013204 (2009)","journal-title":"Theory Comput Syst"},{"issue":"1","key":"89_CR15","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"},{"issue":"14","key":"89_CR16","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1016\/j.tcs.2008.08.020","volume":"410","author":"N. Nisse","year":"2009","unstructured":"Nisse N., Soguet D.: Graph searching with advice. Theor. Comput. Sci. 410(14), 1307\u20131318 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"89_CR17","unstructured":"Parsons, T.D.: The search number of a connected graph. In: Proceedings of the 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, pp. 549\u2013554, 1978"},{"key":"89_CR18","doi-asserted-by":"crossref","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number. In: Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC), pp. 908\u2013920, 2004","DOI":"10.1007\/978-3-540-30551-4_77"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0089-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-009-0089-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0089-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:43Z","timestamp":1559136403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-009-0089-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,22]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s00446-009-0089-1","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,22]]}}}