{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:13:34Z","timestamp":1764173614940},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T00:00:00Z","timestamp":1272326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9328-4","type":"journal-article","created":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T14:22:35Z","timestamp":1272291755000},"page":"763-777","source":"Crossref","is-referenced-by-count":13,"title":["Fast searching games on graphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Donald","family":"Stanley","sequence":"first","affiliation":[]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,27]]},"reference":[{"key":"9328_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/070703053","volume":"23","author":"N Alon","year":"2008","unstructured":"Alon N, Pralat P, Wormald R (2008) Cleaning regular graphs with brushes. SIAM J Discrete Math 23:233\u2013250","journal-title":"SIAM J Discrete Math"},{"key":"9328_CR2","unstructured":"Alspach B (2005) Searching and sweeping graphs: A brief survey. In: Le matematiche, 34\u00a0pp"},{"key":"9328_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/dimacs\/005\/02","volume":"5","author":"D Bienstock","year":"1991","unstructured":"Bienstock D (1991) Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser Discrete Math Theor Comput Sci 5:33\u201349","journal-title":"DIMACS Ser Discrete Math Theor Comput Sci"},{"key":"9328_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 (1991) Monotonicity in graph searching. J Algorithms 12:239\u2013245","journal-title":"J Algorithms"},{"key":"9328_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02115752","volume":"33","author":"D Borie","year":"1991","unstructured":"Borie D, Parker R, Tovey C (1991) Algorithms for recognition of regular properties and decomposition of recursive graph families. Ann Oper Res 33:127\u2013149","journal-title":"Ann Oper Res"},{"key":"9328_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(92)90218-K","volume":"43","author":"R Dawes","year":"1992","unstructured":"Dawes R (1992) Some pursuit-evasion problems on grids. Inf Process Lett 43:241\u2013247","journal-title":"Inf Process Lett"},{"key":"9328_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0304-3975(96)00177-6","volume":"172","author":"N Dendris","year":"1997","unstructured":"Dendris N, Kirousis L, Thilikos D (1997) Fugitive-search games on graphs and related parameters. Theor Comput Sci 172:233\u2013254","journal-title":"Theor Comput Sci"},{"key":"9328_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-540-68880-8_15","volume-title":"Proceedings of the 4th international conference on algorithmic aspects in information and management (AAIM\u201908)","author":"D Dyer","year":"2008","unstructured":"Dyer D, Yang B, Ya\u015far O (2008) On the fast searching problem. In: Proceedings of the 4th international conference on algorithmic aspects in information and management (AAIM\u201908). Lecture notes in computer science, vol 5034. Springer, Berlin, pp 143\u2013154"},{"key":"9328_CR9","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.dam.2007.02.006","volume":"156","author":"J Ellis","year":"2008","unstructured":"Ellis J, Warren R (2008) Lower bounds on the pathwidth of some grid-like graphs. Discrete Appl Math 156:545\u2013555","journal-title":"Discrete Appl Math"},{"key":"9328_CR10","doi-asserted-by":"crossref","unstructured":"Fellows M, Langston M (1989) On search, decision and the efficiency of polynomial time algorithm. In: Proceedings of the 21st ACM symposium on theory of computing (STOC 89), pp 501\u2013512","DOI":"10.1145\/73007.73055"},{"key":"9328_CR11","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.jda.2005.06.004","volume":"4","author":"F Fomin","year":"2006","unstructured":"Fomin F, Thilikos D (2006) A 3-approximation for the pathwidth of Halin graphs. J Discrete Algorithms 4:499\u2013510","journal-title":"J Discrete Algorithms"},{"key":"9328_CR12","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F Fomin","year":"2008","unstructured":"Fomin F, Thilikos D (2008) An annotated bibliography on guaranteed graph searching. Theor Comput Sci 399:236\u2013245","journal-title":"Theor Comput Sci"},{"key":"9328_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"M Frankling","year":"2000","unstructured":"Frankling M, Galil Z, Yung M (2000) Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. J ACM 47:225\u2013243","journal-title":"J ACM"},{"key":"9328_CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L Kirousis","year":"1996","unstructured":"Kirousis L, Papadimitriou C (1996) Searching and pebbling. Theor Comput Sci 47:205\u2013218","journal-title":"Theor Comput Sci"},{"key":"9328_CR15","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A LaPaugh","year":"1993","unstructured":"LaPaugh A (1993) Recontamination does not help to search a graph. J ACM 40:224\u2013245","journal-title":"J ACM"},{"key":"9328_CR16","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"F Makedon","year":"1985","unstructured":"Makedon F, Papadimitriou C, Sudborough I (1985) Topological bandwidth. SIAM J Algebr Discrete Methods 6:418\u2013444","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"9328_CR17","doi-asserted-by":"crossref","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 (1988) The complexity of searching a graph. J ACM 35:18\u201344","journal-title":"J ACM"},{"key":"9328_CR18","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.tcs.2008.02.037","volume":"399","author":"ME Messinger","year":"2008","unstructured":"Messinger ME, Nowakowski RJ, Pralat P (2008) Cleaning a network with brushes. Theor Comput Sci 399:191\u2013205","journal-title":"Theor Comput Sci"},{"key":"9328_CR19","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1137\/0402013","volume":"2","author":"K Sugihara","year":"1989","unstructured":"Sugihara K, Suzuki I (1989) Optimal algorithms for a pursuit-evasion problem in grids. SIAM J Discrete Math 2:126\u2013143","journal-title":"SIAM J Discrete Math"},{"key":"9328_CR20","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB (1996) Introduction to graph theory. Prentice-Hall, Englewood Cliffs"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9328-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9328-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9328-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:14Z","timestamp":1559262194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9328-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,27]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9328"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9328-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,27]]}}}