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

577 Fibonacci heaps and their uses in improved network optimization problems – M L Fredman, R E Tarjan - 1987
157 Trans-dichotomous algorithms for minimum spanning trees and shortest paths – M L Fredman, D E Willard - 1994
8557 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
1444 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
200 E.: Design and implementation of an efficient priority queue – van Emde Boas, P Kaas, R Zijlstra - 1977
24 Improved shortest paths on the word RAM – Torben Hagerup - 2000
70 On RAM priority queues – Mikkel Thorup - 1996
826 A note on two problems in connection with graphs”. Numerische Mathematik, 1:260–271 – E W Dijkstra - 1959
326 On a Routing Problem – R Bellman - 1958
2447 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
60 Scaling Algorithms for Network Problems – Harold N. Gabow - 1985
17 monotone priority queues – heaps Buckets, lists - 1997
26 Recent results on the single-source shortest paths problem – R Raman - 1997
46 Priority queues: Small, monotone and trans-dichotomous – R Raman
85 Algorithm 360: Shortest-path forest with topological ordering – R B Dial - 1969
156 Efficient algorithms for shortest paths in sparse networks – D B Johnson - 1977
770 Flows in networks – D R Fulkerson - 1962
56 Scaling algorithms for the shortest paths problem – Andrew V. Goldberg - 1993
130 Faster scaling algorithms for network problems – Harold N. Gabow, Robert E. Tarjan - 1989