{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:05Z","timestamp":1725497165948},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_4","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"33-44","source":"Crossref","is-referenced-by-count":2,"title":["Monotonicity of Non-deterministic Graph Searching"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Mazoit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J. Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J.: Directed Path-width and Monotonicity in Digraph Searching. Graphs and Combinatorics\u00a022(2), 161\u2013172 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: SPAA 2002. Proceedings of the 14th Annual ACM-SIAM Symposium on Parallel Algorithms and Architectures, pp. 200\u2013209 (2002)","DOI":"10.1145\/564870.564906"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11672142_43","volume-title":"STACS 2006","author":"D. Berwanger","year":"2006","unstructured":"Berwanger, D., Dawar, A., Hunter, P.W., Kreutzer, S.: Dag-width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 524\u2013536. Springer, Heidelberg (2006)"},{"issue":"2","key":"4_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.D.: Monotonicity in graph searching. Journal Algorithms\u00a012(2), 239\u2013245 (1991)","journal-title":"Journal Algorithms"},{"issue":"1\u20132","key":"4_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(96)00177-6","volume":"172","author":"N.D. Dendris","year":"1997","unstructured":"Dendris, N.D., Kirousis, L.M., Thilikos, D.M.: Fugitive-search games on graphs and related parameters. Theoretical Computer Science\u00a0172(1\u20132), 233\u2013254 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"Ellis, J.A., Sudborough, I.H., Turner, J.S.: The Vertex Separation and Search Number of a Graph. Information and Computation\u00a0113(1), 50\u201379 (1994)","journal-title":"Information and Computation"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11549345_32","volume-title":"Mathematical Foundations of Computer Science 2005","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Fraigniaud, P., Nisse, N.: Nondeterministic Graph Searching: From Pathwidth to Treewidth. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 364\u2013375. Springer, Heidelberg (2005)"},{"key":"4_CR8","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)"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T. Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed Tree-Width. Journal of Combinatorial Theory Series B\u00a082(1), 138\u2013155 (2001)","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L.M. Kirousis","year":"1986","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoretical Computer Science\u00a047(2), 205\u2013218 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","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. Journal of the ACM\u00a040(2), 224\u2013245 (1993)","journal-title":"Journal of the ACM"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","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. Journal of the ACM\u00a035(1), 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Obdrz\u00e1lek, J.: DAG-width: connectivity measure for directed graphs. In: SODA 2006. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 814\u2013821 (2006)","DOI":"10.1145\/1109557.1109647"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. Theory and Applications of Graphs, 426\u2013441 (1976)","DOI":"10.1007\/BFb0070400"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. X. Obstructions to Tree-Decomposition. Journal of Combinatorial Theory Series B\u00a052(2), 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P.D. Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph Searching and a Min-Max Theorem for Tree-Width. Journal of Combinatorial Theory Series B\u00a058(1), 22\u201333 (1993)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"4_CR18","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","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:36Z","timestamp":1619520156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_4","relation":{},"subject":[]}}