Faster Algorithms for the Shortest Path Problem (1990)

Cached

Download Links

by Ravindra K. Ahuja , Kurt Mehlhorn , James B. Orlin , Robert E. Tarjan
Venue:J. ASSOC. COMPUT. MACH
Citations:103 - 10 self

Documents Related by Co-Citation

579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
162 Trans-dichotomous algorithms for minimum spanning trees and shortest paths – M Fredman, D E Willard - 1990
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
203 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977
325 On a routing problem – R Bellman - 1958
70 On RAM priority queues – Mikkel Thorup - 1996
763 Flows in Networks – L Ford, D Fulkerson - 1962
824 A note on two problems in connection with graphs – E W Dijkstra - 1959
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
59 Scaling Algorithms for Network Problems – Harold N. Gabow - 1985
25 Recent results on the single-source shortest paths problem – R Raman - 1997
46 Priority queues: Small, monotone and trans-dichotomous – R Raman - 1996
86 Algorithm 360: Shortest path forest with topological ordering – R Dial - 1969
159 E cient algorithms for shortest paths in sparse networks – D B Johnson - 1977
24 Improved shortest paths on the word RAM – Torben Hagerup, Fachbereich Informatik
56 Scaling algorithms for the shortest paths problem – Andrew V. Goldberg - 1993
126 Faster scaling algorithms for network problems – Harold N. Gabow, Robert E. Tarjan - 1989
607 Data Structures and Network Algorithms – R E Tarjan - 1983