I/O-Efficient Undirected Shortest Paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 434-445

  Meyer, Ulrich ^a   Zeh, Norbert ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EDGE WEIGHTS; RANDOM EDGE WEIGHTS; SHORTEST PATH; SINGLE SOURCE SHORTEST PATH PROBLEMS; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 0142214927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_40     Document Type: Article

References (14)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Comm. of the ACM, pp. 1116-1127, 1988.
2. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan. Faster algorithms for the shortest path problem. Journal of the ACM, 37(2):213-233, 1990.
3. L. Arge, G. S. Brodai, and L. Toma. On external memory MST, SSSP, and multiway planar separators. Proc. 7th SWAT, LNCS 1851, pp. 433-447. Springer, 2000.
4. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengfoff, and J. S. Vitter. External-memory graph algorithms. Proc. 6th ACM-SIAM SODA, pp. 139-149, 1995.
5. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra's shortest path algorithm. Proc. 23rd MFCS, LNCS 1450, pp. 722-731. Springer, 1998.
6. E. W. Dijkstra. A note on two problems in connection with graphs. Numerical Mathematics, 1:269-271, 1959.
7. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
8. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. Proc. 8th IEEE SPDP, pp. 169-176, 1996.
9. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. Proc. 10th ESA, LNCS 2461, pp. 723-73. Springer, 2002.
10. U: Meyer, P. Sanders, and J. F. Sibeyn, editors. Algorithms for Memory Hierarchies, LNCS 2625. Springer, 2003.
11. R. Raman. Recent results on the single-source shortest paths problem. ACM SIGACT News, 28(2):81-87, June 1997.
12. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46:362-394, 1999.
13. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.
14. N. Zeh. I/O-Efficient Algorithms for Shortest Path Related Problems. PhD thesis, School of Computer Science, Carleton University, 2002.