{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:10:37Z","timestamp":1743145837839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319559100"},{"type":"electronic","value":"9783319559117"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_48","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"669-683","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Searching on Cartesian Products of Graphs"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Xue","sequence":"first","affiliation":[]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"48_CR1","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":"48_CR2","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.: Monotonicity in graph searching. J. Algorithms 12(2), 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"key":"48_CR3","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Soc., Providence (2011)"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Bonato, A., Yang, B.: Graph searching and related problems. In: Pardalos, P., Du, D.-Z., Graham, R. (eds.) Handbook of Combinatorial Optimization, 2nd edn., pp. 1511\u20131558. Springer, New York (2013)","DOI":"10.1007\/978-1-4419-7997-1_76"},{"issue":"3","key":"48_CR5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.disc.2005.12.011","volume":"306","author":"S Chandran","year":"2006","unstructured":"Chandran, S., Kavitha, T.: The treewidth and pathwidth of hypercubes. Discrete Math. 306(3), 359\u2013365 (2006)","journal-title":"Discrete Math."},{"key":"48_CR6","doi-asserted-by":"crossref","first-page":"1950","DOI":"10.1016\/j.dam.2013.03.004","volume":"161","author":"D Dereniowski","year":"2013","unstructured":"Dereniowski, D., Diner, \u00d6., Dyer, D.: Three-fast-searchable graphs. Discrete Appl. Math. 161, 1950\u20131958 (2013)","journal-title":"Discrete Appl. Math."},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-68880-8_15","volume-title":"Algorithmic Aspects in Information and Management","author":"D Dyer","year":"2008","unstructured":"Dyer, D., Yang, B., Ya\u015far, \u00d6.: On the fast searching problem. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 143\u2013154. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-68880-8_15"},{"issue":"3","key":"48_CR8","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoret. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"163","key":"48_CR9","first-page":"163","volume":"36","author":"G Hahn","year":"2007","unstructured":"Hahn, G.: Cops, robbers and graphs. Tatra Mt. Math. Publ. 36(163), 163\u2013176 (2007)","journal-title":"Tatra Mt. Math. Publ."},{"key":"48_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"LM Kirousis","year":"1986","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoret. Comput. Sci. 47, 205\u2013218 (1986)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"48_CR11","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"FS Makedon","year":"1985","unstructured":"Makedon, F.S., Papadimitriou, C.H., Sudborough, I.H.: Topological bandwidth. SIAM J. Algebraic Discrete Methods 6(3), 418\u2013444 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"48_CR12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N Megiddo","year":"1988","unstructured":"Megiddo, N., LouisHakimi, S., 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":"4","key":"48_CR13","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s10878-010-9328-4","volume":"22","author":"D Stanley","year":"2011","unstructured":"Stanley, D., Yang, B.: Fast searching games on graphs. J. Comb. Optim. 22(4), 763\u2013777 (2011)","journal-title":"J. Comb. Optim."},{"key":"48_CR14","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1016\/j.tcs.2010.12.065","volume":"412","author":"B Yang","year":"2011","unstructured":"Yang, B.: Fast edge-searching and fast searching on graphs. Theoret. Comput. Sci. 412, 1208\u20131219 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T04:18:14Z","timestamp":1511324294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}