{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:47:55Z","timestamp":1763466475685},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662006"},{"type":"electronic","value":"9783540486862"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48686-0_5","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:12Z","timestamp":1184586852000},"page":"51-60","source":"Crossref","is-referenced-by-count":14,"title":["An External Memory Data Structure for Shortest Path Queries (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"David","family":"Hutchinson","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"unstructured":"Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D.E. Vengroff, J. S. Vitter. External-memory graph algorithms. Proc. 6th SODA, Jan. 1995.","key":"5_CR1"},{"unstructured":"A. Crauser, K. Mehlhorn, U. Meyer. K\u00fcrzeste-Wege-Berechnung bei sehr gro\u03b2en Datenmengen. Aachener Beitr. zur Inf. (21). Verl. d. Augustinus Buchh. 1997.","key":"5_CR2"},{"doi-asserted-by":"crossref","unstructured":"F. Dehne, W. Dittrich, D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. Proc. 9th SPAA, pp. 106\u2013115, 1997.","key":"5_CR3","DOI":"10.1145\/258492.258503"},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","first-page":"151","volume-title":"Proc. of the 22nd Workshop on Graph-Theoretic Concepts in Comp. Sci.","author":"H. N. Djidjev","year":"1996","unstructured":"H. N. Djidjev. Efficient algorithms for shortest path queries in planar digraphs. Proc. of the 22nd Workshop on Graph-Theoretic Concepts in Comp. Sci., Lecture Notes in Comp. Sci., pp. 151\u2013165. Springer Verlag, 1996."},{"issue":"6","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G. N. Frederickson","year":"1987","unstructured":"G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comp., 16(6):1004\u20131022, Dec. 1987.","journal-title":"SIAM J. Comp."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2):177\u2013189, 1979.","journal-title":"SIAM J. Appl. Math."},{"unstructured":"K. Munagala, A. Ranade. I\/O-complexity of graph algorithms. Proc. 10th SODA, Jan. 1999.","key":"5_CR7"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01940646","volume":"16","author":"M. Nodine","year":"1996","unstructured":"M. Nodine, M. Goodrich, J. Vitter. Blocking for external graph searching. Algorithmica, 16(2):181\u2013214, Aug. 1996.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"J. Vitter. External memory algorithms. Proc. 17th ACM Symp. on Principles of Database Systems, June 1998.","key":"5_CR9","DOI":"10.1145\/275487.275501"},{"issue":"2-3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J. Vitter","year":"1994","unstructured":"J. Vitter, E. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110\u2013147, 1994.","journal-title":"Algorithmica"},{"issue":"2-3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BF01185208","volume":"12","author":"J. Vitter","year":"1994","unstructured":"J. Vitter, E. Shriver. Algorithms for parallel memory II: Hierarchical multilevel memories. Algorithmica, 12(2-3):148\u2013169, 1994.","journal-title":"Algorithmica"},{"unstructured":"N. Zeh. An External-Memory Data Structure for Shortest Path Queries. Diplomarbeit, Fak. f. Math. und Inf., Friedrich-Schiller-Univ. Jena, Nov. 1998.","key":"5_CR12"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48686-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:02:30Z","timestamp":1550433750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48686-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662006","9783540486862"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48686-0_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}