{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:09:07Z","timestamp":1786144147444,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735557","type":"print"},{"value":"9783540735564","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_37","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"354-365","source":"Crossref","is-referenced-by-count":4,"title":["Arc Searching Digraphs Without Jumping"],"prefix":"10.1007","author":[{"given":"Brian","family":"Alspach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danny","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis","family":"Hanson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Alspach, B.: Searching and sweeping graphs: A brief survey. Combinatorics 2004 (Catania, 2004). Matematiche (Catania), Fasc. I\u2013II, vol. 59, pp. 5\u201337 (2004)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1017\/S0004972700041101","volume":"10","author":"B. Alspach","year":"1974","unstructured":"Alspach, B., Pullman, N.: Path decompositions of digraphs. Bull. Austral. Math. Soc.\u00a010, 421\u2013427 (1974)","journal-title":"Bull. Austral. Math. Soc."},{"key":"37_CR3","first-page":"501","volume-title":"21st ACM Symp. on Theory of Computing (STOC 1989)","author":"M. Fellows","year":"1989","unstructured":"Fellows, M., Langston, M.: On search, decision and the efficiency of polynomial time algorithm. In: 21st ACM Symp. on Theory of Computing (STOC 1989), pp. 501\u2013512. ACM Press, New York (1989)"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"M. Frankling","year":"2000","unstructured":"Frankling, M., Galil, Z., Yung, M.: Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. Journal of ACM\u00a047, 225\u2013243 (2000)","journal-title":"Journal of ACM"},{"key":"37_CR5","unstructured":"Gross, J.L., Yellen, J. (eds.): Handbook of Graph Theory, Discrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton, FL (2004)"},{"key":"37_CR6","first-page":"637","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"P. Hunter","year":"2007","unstructured":"Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 637\u2013644. ACM Press, New York (2007)"},{"key":"37_CR7","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, 138\u2013154 (2001)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"37_CR8","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. Theoret. Comput. Sci.\u00a047, 205\u2013218 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR9","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., Johnson, D., Papadimitriou, C.H.: The complexity of searching a graph. Journal of ACM\u00a035, 18\u201344 (1988)","journal-title":"Journal of ACM"},{"key":"37_CR10","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 Appl. Math.\u00a041, 1\u201311 (1993)","journal-title":"Discrete Appl. Math."},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1145\/1109557.1109647","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006","author":"J. Obdr\u017e\u00e1lek","year":"2006","unstructured":"Obdr\u017e\u00e1lek, J.: DAG-width - Connectivity measure for directed graphs. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 814\u2013821. ACM Press, New York (2006)"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","first-page":"426","volume-title":"Theory and Applications of Graphs","author":"T. Parsons","year":"1976","unstructured":"Parsons, T.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs. LNCS, pp. 426\u2013441. Springer, Heidelberg (1976)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71549-8","volume-title":"Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 2007)","author":"B. Yang","year":"2007","unstructured":"Yang, B., Cao, Y.: Directed searching digraphs: monotonicity and complexity. In: Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 2007). LNCS, vol.\u00a04484, Springer, Heidelberg (2007)"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-540-71549-8","volume-title":"Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM 2007)","author":"B. Yang","year":"2007","unstructured":"Yang, B., Cao, Y.: Digraph strong searching: monotonicity and complexity. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM 2007). LNCS, vol.\u00a04508, pp. 37\u201346. Springer, Heidelberg (2007)"},{"key":"37_CR15","unstructured":"Yang, B., Cao, Y.: On the Monotonicity of Weak Searching on Digraphs (submitted)"},{"key":"37_CR16","unstructured":"Yang, B., Dyer, D., Alspach, B.: Searching graphs with large clique number (submitted)"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1007\/978-3-540-28648-6_140","volume-title":"Algorithms and Computation","author":"B. Yang","year":"2004","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number (extended abstract). In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 880\u2013892. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:46Z","timestamp":1619517106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}