On the comparison-addition complexity of all-pairs shortest paths

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

Volumn 2518 LNCS, Issue , 2002, Pages 32-43

  Pettie, Seth ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALL-PAIRS SHORTEST PATHS; ARBITRARY GRAPHS; DIJKSTRA'S ALGORITHMS; EFFICIENT IMPLEMENTATION; POLYNOMIAL-TIME; ALL PAIRS SHORTEST PATHS; INVERSE ACKERMANN FUNCTION; S-ALGORITHMS;

GRAPH THEORY; POLYNOMIAL APPROXIMATION; INVERSE PROBLEMS;

ALGORITHMS;

EID: 84878663174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_4     Document Type: Conference Paper

References (16)

1. T. Cormen, C. Leiserson, R. Rivest, C. Stein. Introduction to Algorithms. MIT Press, 2001.
2. E. W. Dijkstra. A note on two problems in connexion with graphs. In Numer. Math., 1 (1959), 269-271.
3. M. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5 (1976), no. 1, 83-89.
4. M. L. Fredman, R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. In J A CM 34 (1987), 596-615.
5. H. N. Gabow. A scaling algorithm for weighted matching on general graphs. In 26th Ann. Symp. on Foundations of Computer Science (FOCS 1985), 90-99.
6. T. Hagerup. Improved shortest paths on the word RAM. In Proceedings 27th Int'l Colloq. on Automata, Languages and Programming (ICALP 2000), LNCS volume 1853, 61-72.
7. D. B. Johnson. Efficient algorithms for shortest paths in sparse networks. JACM 24 (1977), 1-13.
8. D. R. Karger, D. Koller, S. J. Phillips. Finding the hidden path: time bounds for all-pairs shortest paths. SIAM J. on Comput. 22 (1993), no. 6, 1199-1217.
9. S. Pettie. A faster all-pairs shortest path algorithm for real-weighted sparse graphs. Proceedings 29th Int'l Colloq. on Automata, Languages and Programming (ICALP 2002), LNCS 2380, 85-97.
10. S. Pettie. On the comparison-addition complexity of all-pairs shortest paths. UTCS Technical Report TR-02-21, May 2002.
11. S. Pettie, V. Ramachandran. Computing shortest paths with comparisons and additions (extended abstract). Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, 267-276.
12. S. Pettie, V. Ramachandran, S. Sridhar. Experimental evaluation of a new shortest path algorithm. 4th Workshop on Algorithm Engineering and Experiments (ALENEX), 2002.
13. G. Ramalingam, T. Reps. An incremental algorithm for a generalization of the shortest path problem. J. Algorithms 21 (1996), 267-305. (Pubitemid 126412538)
14. T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett. 43 (1992), no. 4, 195-199.
15. M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. JACM 46 (1999), no. 3, 362-394.
16. U. Zwick. Exact and approximate distances in graphs - A survey. Updated version at http://www.cs.tau.ac.il/zwick/ Proc. of 9th ESA (2001), 33-48. (Pubitemid 33328945)