I/O-efficient undirected shortest paths with unbounded edge lengths

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

Volumn 4168 LNCS, Issue , 2006, Pages 540-551

  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; COMPUTATIONAL METHODS; GRAPH THEORY; TREES (MATHEMATICS);

NON NEGATIVE EDGE LENGTHS; SHORTEST PATHS; SPANNING TREES;

MOTION PLANNING;

EID: 33750683948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_49     Document Type: Conference Paper

References (13)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Comm. ACM, pp. 1116-1127, 1988.
2. L. Arge, G. S. Brodal, and L. Toma. On external-memory MST, SSSP and multiway planar graph separation. J. Alg., 53(2):186-206, 2004.
3. L. Arge, L. Toma, and N. Zeh. I/O-efficient algorithms for planar digraphs. In Proc. 15th SPAA, pp. 85-93, 2003.
4. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proc. 11th SODA, pp. 859-860, 2000.
5. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th SODA, pp. 139-149, 1995.
6. E. W. Dijkstra. A note on two problems in connection with graphs. Num. Math., 1:269-271, 1959.
7. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th SPDP, pp. 169-176, 1996.
8. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In Proc. 10th ESA, LNCS 2461, pp. 723-735. Springer-Verlag, 2002.
9. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths. In Proc. 11th ESA, LNCS 2832, pp. 434-445. Springer-Verlag, 2003.
10. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths with unbounded weights. Tech. Report CS-2006-04, Faculty of Comp. Sci., Dalhousie Univ., 2006.
11. S. Pettie and V. Ramachandran. Computing shortest paths with comparisons and additions. In Proc. 13th SODA, pp. 267-276, 2002.
12. M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. J. ACM, 46:362-394, 1999.
13. M. Thorup. Floats, integers, and single source shortest paths. J. Alg., 35:189-201, 2000.