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

104

Faster algorithms for the shortest path problem
– Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan
 1990

8557

R.: Introduction to Algorithms
– T Cormen, C Leiserson, Rivest
 1990

824

A note on two problems in connection with graphs
– E W Dijkstra
 1959

24

Improved shortest paths on the word RAM
– Torben Hagerup, Fachbereich Informatik

34

A Simple Shortest Path Algorithm with Linear Average Time
– Andrew V. Goldberg

25

Recent results on the singlesource shortest paths problem
– R Raman
 1997

167

Faster ShortestPath Algorithms for Planar Graphs
– Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian
 1994

159

E cient algorithms for shortest paths in sparse networks
– D B Johnson
 1977

162

Transdichotomous algorithms for minimum spanning trees and shortest paths
– M Fredman, D E Willard
 1990

19

Computing Shortest Paths with Comparisons and Additions
– Seth Pettie , Vijaya Ramachandran
 2002

43

A new upper bound on the complexity of the all pairs shortest path problem
– T Takaoka
 1992

63

New bounds on the complexity of the shortest path problem
– M Fredman
 1976

64

Finding the Hidden Path: Time Bounds for AllPairs Shortest Paths
– David R. Karger, Daphne Koller, Steven J. Phillips
 1993

28

SingleSource ShortestPaths on Arbitrary Directed Graphs in Linear AverageCase Time
– Ulrich Meyer
 2001

13

Experimental Evaluation of a New Shortest Path Algorithm (Extended Abstract)
– Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
 2002

36

An all pairs shortest path algorithm with expected running time O(n 210g n
– A Moffat, T Takaoka
 1985

30

A scaling algorithm for weighted matching on general graphs
– H N Gabow
 1985
