{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T09:42:12Z","timestamp":1756460532002},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354015650X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015765","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T00:45:47Z","timestamp":1132706747000},"page":"394-403","source":"Crossref","is-referenced-by-count":2,"title":["A bidirectional shortest-path algorithm with good average-case behavior (preliminary version)"],"prefix":"10.1007","author":[{"given":"Michael","family":"Luby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Ragde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","unstructured":"Aho, A.A., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Balas, E., Toth, P., \u201cBranch and Bound Methods for the Traveling Salesman Problem\u201d, MSRR 488, Carnegie-Mellon University, March 1983","DOI":"10.21236\/ADA126957"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W. \u201cA Note on Two Problems in Connection With Graphs\u201d, Numerische Mathematik, 1 (1959), pp. 260\u2013271.","journal-title":"Numerische Mathematik"},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M. \u201cTheoretical Improvements in Algorithmic Efficiency for Network Flow Problems\u201d, Journal of the ACM, Vol. 19, No. 2, April 1972, pp. 248\u2013264","journal-title":"Journal of the ACM"},{"key":"40_CR5","unstructured":"Lawler, E.L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976."},{"key":"40_CR6","unstructured":"Ma, Y. \u201cA Shortest Path Algorithm with Expected Running Time O(\u221aV logV)\u201d, Master's Project Report, UC Berkeley."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Mitrinovic, D.S. Analytic Inequalities. Springer-Verlag, 1970.","DOI":"10.1007\/978-3-642-99970-3"},{"key":"40_CR8","unstructured":"Perl, Y. \u201cAverage Analysis of Simple Path Algorithms\u201d, Tech. Report UIUCDCS-R-77-905, University of Illinois at Urbana-Champaign, 1977."},{"key":"40_CR9","first-page":"127","volume":"6","author":"I. Pohl","year":"1971","unstructured":"Pohl, I. \u201cBidirectional Search.\u201d Machine Intelligence, 6(1971), pp. 127\u2013140.","journal-title":"Machine Intelligence"},{"key":"40_CR10","unstructured":"Renyi, A. Probability Theory. North-Holland, 1970."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:20:21Z","timestamp":1586564421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0015765","relation":{},"subject":[]}}