{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:48Z","timestamp":1759063788476},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_6","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"52-61","source":"Crossref","is-referenced-by-count":3,"title":["On the Monotonicity of Weak Searching"],"prefix":"10.1007","author":[{"given":"Boting","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yi","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-73556-4_37","volume-title":"Combinatorial Optimization and Applications","author":"B. Alspach","year":"2007","unstructured":"Alspach, B., Dyer, D., Hanson, D., Yang, B.: Arc Searching Digraphs without Jumping. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 354\u2013365. Springer, Heidelberg (2007)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J. Barat","year":"2006","unstructured":"Barat, J.: Directed Path-Width and Monotonicity in Digraph searching. Graphs and Combinatorics\u00a022, 161\u2013172 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"6_CR3","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. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0166-218X(02)00459-6","volume":"131","author":"F. Fomin","year":"2003","unstructured":"Fomin, F., Thilikos, D.: On the Monotonicity of Games Generated by Symmetric Submodular Functions. Discrete Applied Mathematics\u00a0131, 323\u2013335 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0195-6698(87)80034-3","volume":"8","author":"Y.O. Hamidoune","year":"1987","unstructured":"Hamidoune, Y.O.: On a pursuit game on Cayley graphs. European Journal of Combinatorics\u00a08, 289\u2013295 (1987)","journal-title":"European Journal of Combinatorics"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L. Kirousis","year":"1996","unstructured":"Kirousis, L., Papadimitriou, C.: Searching and Pebbling. Theoretical Computer Science\u00a047, 205\u2013218 (1996)","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","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. Journal of ACM\u00a040, 224\u2013245 (1993)","journal-title":"Journal of ACM"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1998","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The Complexity of Searching a Graph. Journal of ACM\u00a035, 18\u201344 (1998)","journal-title":"Journal of ACM"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(93)90242-G","volume":"41","author":"R.J. Nowakowski","year":"1993","unstructured":"Nowakowski, R.J.: Search and Sweep Numbers of Finite Directed Acyclic Graphs. Discrete Applied Mathematics\u00a041, 1\u201311 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-72504-6_12","volume-title":"Theory and Applications of Models of Computation","author":"B. Yang","year":"2007","unstructured":"Yang, B., Cao, Y.: Directed Searching Digraphs: Monotonicity and Complexity. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 136\u2013147. Springer, Heidelberg (2007)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10878-007-9042-z","volume":"14","author":"B. Yang","year":"2007","unstructured":"Yang, B., Cao, Y.: Monotonicity of Strong Searching on Digraphs. Journal of Combinatorial Optimization\u00a014, 411\u2013425 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"doi-asserted-by":"crossref","unstructured":"Yang, B., Cao, Y.: Digraph Searching, Directed Vertex Separation and Directed Pathwidth. Discrete Applied Mathematics (Accepted, 2007)","key":"6_CR12","DOI":"10.1016\/j.dam.2007.08.045"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:02:22Z","timestamp":1605744142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}