{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:25:29Z","timestamp":1764174329702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_12","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"159-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast Searching on Complete k-partite Graphs"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Xue","sequence":"first","affiliation":[]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Farong","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"12_CR1","first-page":"5","volume":"59","author":"B Alspach","year":"2006","unstructured":"Alspach, B.: Sweeping and searching in graphs: a brief survey. Matematiche 59, 5\u201337 (2006)","journal-title":"Matematiche"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-540-74450-4_46","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"B Alspach","year":"2007","unstructured":"Alspach, B., Dyer, D., Hanson, D., Yang, B.: Lower bounds on edge searching. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 516\u2013527. Springer, Heidelberg (2007)"},{"key":"12_CR3","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."},{"key":"12_CR4","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061","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., Philadelphia (2011)"},{"issue":"13","key":"12_CR5","doi-asserted-by":"publisher","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(13), 1950\u20131958 (2013)","journal-title":"Discrete Appl. Math."},{"key":"12_CR6","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)"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","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":"12_CR8","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."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","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":"12_CR10","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. J. ACM 35(1), 18\u201344 (1988)","journal-title":"J. ACM"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","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":"12_CR12","doi-asserted-by":"crossref","unstructured":"Xue, Y., Yang, B.: Fast searching on cartesian products of graphs. In: The 14th Annual Conference on Theory and Applications of Models of Computation (2017, accepted)","DOI":"10.1007\/978-3-319-55911-7_48"},{"issue":"12","key":"12_CR13","doi-asserted-by":"publisher","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(12), 1208\u20131219 (2011)","journal-title":"Theoret. Comput. Sci."}],"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-319-48749-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:19:00Z","timestamp":1558477140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/cocoa2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}