{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:21Z","timestamp":1794381081037,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_15","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"146-157","source":"Crossref","is-referenced-by-count":14,"title":["External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laura","family":"Toma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"9","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The Input\/Output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-44985-X_37","volume-title":"Algorithm Theory - SWAT 2000","author":"L. Arge","year":"2000","unstructured":"Arge, L., Brodal, G.S., Toma, L.: On external memory MST, SSSP and multiway planar graph separation. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 433\u2013447. Springer, Heidelberg (2000)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Arge, L., Toma, L., Zeh, N.: I\/O-efficient topological sorting of planar DAGs. In: Proc. ACM Symposium on Parallel Algorithms and Architectures (2003)","DOI":"10.1145\/777412.777427"},{"key":"15_CR4","unstructured":"Buchsbaum, A.L., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.R.: On external memory graph traversal. In: Proc. SODA, pp. 859\u2013860 (2000)"},{"key":"15_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. SODA, pp. 139\u2013149 (1995)"},{"key":"15_CR6","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik (1969)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing\u00a016, 1004\u20131022 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kumar, V., Schwabe, E.: Improved algorithms and data structures for solving graph problems in external memory. In: Proc. SPDP, pp. 169\u2013177 (1996)","DOI":"10.1109\/SPDP.1996.570330"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal of Applied Math.\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal of Applied Math."},{"key":"15_CR10","unstructured":"Maheshwari, A., Zeh, N.: I\/O-optimal algorithms for planar graphs using separators. In: Proc. SODA 2002, pp. 372\u2013381. ACM\u2013SIAM (2002)"},{"key":"15_CR11","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":"15_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms for Memory Hierarchies","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625. Springer, Heidelberg (2003)"},{"key":"15_CR13","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":"15_CR14","unstructured":"Munagala, K., Ranade, A.: I\/O-complexity of graph algorithms. In: Proc. SODA, pp. 687\u2013694 (1999)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. EFF summer school on massive data sets","author":"N. Zeh","year":"2004","unstructured":"Zeh, N.: I\/O-efficient graph algorithms. In: Proc. EFF summer school on massive data sets. LNCS, Springer, Heidelberg (2004) (to appear)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-44676-1_3","volume-title":"Algorithms - ESA 2001","author":"U. Zwick","year":"2001","unstructured":"Zwick, U.: Exact and approximate distances in graphs - a survey. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 33\u201348. Springer, Heidelberg (2001)"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/567112.567114","volume":"49","author":"U. Zwick","year":"2002","unstructured":"Zwick, U.: All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM\u00a049, 289\u2013317 (2002)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:53Z","timestamp":1619998253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_15","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}