{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T20:51:31Z","timestamp":1726174291555},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031160806"},{"type":"electronic","value":"9783031160813"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16081-3_34","type":"book-chapter","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:02:24Z","timestamp":1663452144000},"page":"394-405","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Searching on\u00a0k-Combinable Graphs"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Xue","sequence":"first","affiliation":[]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,18]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","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":"34_CR2","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/978-1-4419-7997-1_76","volume-title":"Handbook of Combinatorial Optimization","author":"A Bonato","year":"2013","unstructured":"Bonato, A., Yang, B.: Graph searching and related problems. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 1511\u20131558. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_76"},{"issue":"5","key":"34_CR3","first-page":"72","volume":"6","author":"R Breisch","year":"1967","unstructured":"Breisch, R.: An intuitive approach to speleotopology. Southwestern Cavers 6(5), 72\u201378 (1967)","journal-title":"Southwestern Cavers"},{"issue":"13","key":"34_CR4","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. Discret. Appl. Math. 161(13), 1950\u20131958 (2013)","journal-title":"Discret. Appl. Math."},{"key":"34_CR5","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). https:\/\/doi.org\/10.1007\/978-3-540-68880-8_15"},{"issue":"3","key":"34_CR6","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":"3","key":"34_CR7","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":"34_CR8","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., Papadimitrioum, C.H.: The complexity of searching a graph. J. ACM 35(1), 18\u201344 (1988)","journal-title":"J. ACM"},{"key":"34_CR9","doi-asserted-by":"publisher","unstructured":"Parsons, T.: Pursuit-evasion in a graph. In: Proceedings of the International Conference on the Theory and Applications of Graphs, pp. 426\u2013441. Springer-Verlag (1976). https:\/\/doi.org\/10.1007\/BFb0070400","DOI":"10.1007\/BFb0070400"},{"issue":"4","key":"34_CR10","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":"34_CR11","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2017.03.003","volume":"224","author":"Y Xue","year":"2017","unstructured":"Xue, Y., Yang, B.: The fast search number of a cartesian product of graphs. Discret. Appl. Math. 224, 106\u2013119 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"34_CR12","doi-asserted-by":"publisher","first-page":"3959","DOI":"10.1007\/s00453-018-0456-z","volume":"80","author":"Y Xue","year":"2018","unstructured":"Xue, Y., Yang, B., Zhong, F., Zilles, S.: The fast search number of a complete $$k$$-partite graph. Algorithmica 80(12), 3959\u20133981 (2018)","journal-title":"Algorithmica"},{"issue":"12","key":"34_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","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16081-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:05:30Z","timestamp":1663452330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16081-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160806","9783031160813"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16081-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer Nature EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}