{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:15:48Z","timestamp":1725470148356},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_49","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"540-551","source":"Crossref","is-referenced-by-count":15,"title":["I\/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Comm. ACM, 1116\u20131127 (1988)","DOI":"10.1145\/48529.48535"},{"issue":"2","key":"49_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.jalgor.2004.04.001","volume":"53","author":"L. Arge","year":"2004","unstructured":"Arge, L., Brodal, G.S., Toma, L.: On external-memory MST, SSSP and multi-way planar graph separation. J. Alg.\u00a053(2), 186\u2013206 (2004)","journal-title":"J. Alg."},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Arge, L., Toma, L., Zeh, N.: I\/O-efficient algorithms for planar digraphs. In: Proc. 15th SPAA, pp. 85\u201393 (2003)","DOI":"10.1007\/3-540-36574-5_5"},{"key":"49_CR4","unstructured":"Buchsbaum, A.L., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.R.: On external memory graph traversal. In: Proc. 11th SODA, pp. 859\u2013860 (2000)"},{"key":"49_CR5","unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proc. 6th SODA, pp. 139\u2013149 (1995)"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Num. Math.\u00a01, 269\u2013271 (1959)","journal-title":"Num. Math."},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Kumar, V., Schwabe, E.J.: Improved algorithms and data structures for solving graph problems in external memory. In: Proc. 8th SPDP, pp. 169\u2013176 (1996)","DOI":"10.1109\/SPDP.1996.570330"},{"key":"49_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/3-540-45749-6_63","volume-title":"Algorithms - ESA 2002","author":"K. Mehlhorn","year":"2002","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear I\/O. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 723\u2013735. Springer, Heidelberg (2002)"},{"key":"49_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-39658-1_40","volume-title":"Algorithms - ESA 2003","author":"U. Meyer","year":"2003","unstructured":"Meyer, U., Zeh, N.: I\/O-efficient undirected shortest paths. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 434\u2013445. Springer, Heidelberg (2003)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Meyer, U., Zeh, N.: I\/O-efficient undirected shortest paths with unbounded weights. Tech. Report CS-2006-04, Faculty of Comp. Sci., Dalhousie Univ. (2006)","DOI":"10.1007\/11841036_49"},{"key":"49_CR11","unstructured":"Pettie, S., Ramachandran, V.: Computing shortest paths with comparisons and additions. In: Proc. 13th SODA, pp. 267\u2013276 (2002)"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M. Thorup","year":"1999","unstructured":"Thorup, M.: Undirected single source shortest paths with positive integer weights in linear time. J. ACM\u00a046, 362\u2013394 (1999)","journal-title":"J. ACM"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1006\/jagm.2000.1080","volume":"35","author":"M. Thorup","year":"2000","unstructured":"Thorup, M.: Floats, integers, and single source shortest paths. J. Alg.\u00a035, 189\u2013201 (2000)","journal-title":"J. Alg."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:34Z","timestamp":1605642034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11841036_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}