{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:31Z","timestamp":1725542071516},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_97","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"964-973","source":"Crossref","is-referenced-by-count":2,"title":["Lower Bounds on Fast Searching"],"prefix":"10.1007","author":[{"given":"Donald","family":"Stanley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"97_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02115752","volume":"33","author":"D. Borie","year":"1991","unstructured":"Borie, D., Parker, R., Tovey, C.: Algorithms for recognition of regular properties and decomposition of recursive graph families. Annals of Operations Research\u00a033, 127\u2013149 (1991)","journal-title":"Annals of Operations Research"},{"key":"97_CR2","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.\u00a05034, pp. 143\u2013154. Springer, Heidelberg (2008)"},{"key":"97_CR3","first-page":"129","volume-title":"Combinatorial mathematics and its applications","author":"R. Halin","year":"1971","unstructured":"Halin, R.: Studies on minimally n\u2013connected graphs. In: Welsh, D.J.A. (ed.) Combinatorial mathematics and its applications, pp. 129\u2013136. Academic Press, New York (1971)"},{"key":"97_CR4","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":"97_CR5","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"F. Makedon","year":"1985","unstructured":"Makedon, F., Papadimitriou, C., Sudborough, I.: Topological Bandwidth. SIAM Journal on Algebraic and Discrete Methods\u00a06, 418\u2013444 (1985)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"97_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. Journal of ACM\u00a035, 18\u201344 (1988)","journal-title":"Journal of ACM"},{"key":"97_CR7","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1996)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_97.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:37:02Z","timestamp":1619768222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}