A faster all-pairs shortest path algorithm for real-weighted sparse graphs

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

Volumn 2380 LNCS, Issue , 2002, Pages 85-97

  Pettie, Seth ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

ALL PAIRS SHORTEST PATHS; DIJKSTRA'S ALGORITHMS; EDGE WEIGHTS; REAL-WEIGHTED DIRECTED GRAPHS; RUNNING TIME; SPARSE GRAPHS;

DIRECTED GRAPHS;

EID: 0012619650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_9     Document Type: Conference Paper

References (14)

1. T. Cormen, C. Leiserson, R. Rivest. Intro. to Algorithms. MIT Press, 1990.
2. E. W. Dijkstra. A note on two problems in connexion with graphs. In Numer. Math., 1 (1959), 269-271.
3. M. L. Fredman, R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. In JACM 34 (1987), 596-615.
4. H. N. Gabow. A scaling algorithm for weighted matching on general graphs. In Proc. FOCS 1985, 90-99.
5. T. Hagerup. Improved shortest paths on the word RAM. In Proc. ICALP 2000, LNCS volume 1853, 61-72.
6. D. B. Johnson. Efficient algorithms for shortest paths in sparse networks. J. Assoc. Comput. Mach. 24 (1977), 1-13.
7. S. Pettie. A faster all-pairs shortest path algorithm for real-weighted sparse graphs. UTCS TechnicalRep ort CS-TR-02-13, February, 2002.
8. S. Pettie. On the comparison-addition complexity of all-pairs shortest paths. UTCS TechnicalRep ort CS-TR-02-21, April, 2002.
9. S. Pettie, V. Ramachandran, S. Sridhar. Experimentalev aluation of a new shortest path algorithm. Proceedings of ALENEX 2002.
10. S. Pettie, V. Ramachandran. Computing shortest paths with comparisons and additions. Proceedings of SODA 2002, 267-276.
11. R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci. 18 (1979), no. 2, 110-127.
12. M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. J. Assoc. Comput. Mach. 46 (1999), no. 3, 362-394.
13. P. van Emde Boas, R. Kaas, E. Zijlstra. Design and implementation of an efficient priority queue. Math. Syst. Theory 10 (1977), 99-127.
14. 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.