An external memory data structure for shortest path queries

Discrete Applied Mathematics

Volumn 126, Issue 1, 2003, Pages 55-82

  Hutchinson, David ^a   Maheshwari, Anil ^b   Zeh, Norbert ^b  

^a Duke University   (United States)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

External memory algorithms; Graph algorithms; Planar graphs; Shortest paths

Indexed keywords

EID: 84867956937     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00217-2     Document Type: Conference Paper

References (26)

1. L. Aleksandrov, and H. Djidjev Linear algorithms for partitioning embedded graphs of bounded genus SIAM J. Discrete Math. 9 1996 129 150
2. L. Arge, The buffer tree: a new technique for optimal I/O-algorithms, in: Proceedings of the Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 955, Springer, Berlin, 1995, pp. 334-345.
3. Y.-J. Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter, External-memory graph algorithms, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1995.
4. A. Crauser, K. Mehlhorn, U. Meyer, Kürzeste-Wege-Berechnung bei sehr großen Datenmengen, in: O. Spaniol (Ed.), Promotion tut not: Innovationsmotor "Graduiertenkolleg", Aachener Beiträge zur Informatik, Vol. 21, Verlag der Augustinus Buchhandlung, 1997.
5. F. Dehne, W. Dittrich, D. Hutchinson, Efficient external memory algorithms by simulating coarse-grained parallel algorithms, in: Proceedings of the Ninth ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 106-115.
6. E.W. Dijkstra A note on two problems in connection with graphs Numer. Math. 1 1959 269 271
7. K. Diks, H.N. Djidjev, O. Sykora, and I. Vrto Edge separators of planar and outerplanar graphs with applications J. Algorithms 14 1993 258 279
8. H.N. Djidjev, Efficient algorithms for shortest path queries in planar digraphs, in: Proceedings of the 22nd Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 151-165.
9. G.N. Frederickson Fast algorithms for shortest paths in planar graphs, with applications SIAM J. Comput. 16 6 1987 1004 1022
10. G.N. Frederickson Planar graph decomposition and all pairs shortest paths J. ACM 38 1 1991 162 204
11. M.L. Fredman, and R.E. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms J. ACM 34 1987 596 615
12. H. Gazit, G.L. Miller, A parallel algorithm for finding a separator in planar graphs, in: Proceedings of the 28th Symposium on Foundations of Computer Science, 1987, pp. 238-248.
13. M.T. Goodrich, Planar separators and parallel polygon triangulation, in: Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 507-516.
14. D. Hutchinson, A. Maheshwari, N. Zeh, An external memory data structure for shortest path queries, in: Proceedings of the Fifth ACM-SIAM Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol. 1627, Springer, Berlin, July 1999, pp. 51-60.
15. P. Klein, S. Rao, M. Rauch, S. Subramanian, Faster shortest-path algorithms for planar graphs, in: Proceedings of the 26th ACM Symposium on Theory of Computing, May 1994, pp. 27-37.
16. M. Lanthier, A. Maheshwari, J.-R. Sack, Approximating weighted shortest paths on polyhedral surfaces, in: Proceedings of the 13th Annual ACM Symposium on Computational Geometry, June 1997, pp. 274-283.
17. R.J. Lipton, and R.E. Tarjan A separator theorem for planar graphs SIAM J. Appl. Math. 36 2 1979 177 189
18. A. Maheshwari, N. Zeh, External memory algorithms for outerplanar graphs, in: Proceedings of the ISAAC'99, Lecture Notes in Computer Science, Springer, Berlin, December 1999, to appear.
19. K. Munagala, A. Ranade, I/O-complexity of graph algorithms, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1999.
20. M. Nodine, M. Goodrich, and J. Vitter Blocking for external graph searching Algorithmica 16 2 1996 181 214
21. F.P. Preparata, and M.I. Shamos Computational Geometry - An Introduction 1985 Springer Berlin
22. C. Ruemmler, and J. Wilkes An introduction to disk drive modeling IEEE Comput. 27 3 1994 17 28
23. J.S. Vitter, External memory algorithms, in: Proceedings of the 17th Annual ACM Symposium on Principles of Database Systems, June 1998.
24. J. Vitter, and E. Shriver Algorithms for parallel memory I: two-level memories Algorithmica 12 2-3 1994 110 147
25. J. Vitter, and E. Shriver Algorithms for parallel memory II: hierarchical multilevel memories Algorithmica 12 2-3 1994 148 169
26. N. Zeh, An external-memory data structure for shortest path queries, Diplomarbeit, Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, November 1998.