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

8557

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

83

All Pairs Almost Shortest Paths
– Dorit Dor, Shay Halperin, Uri Zwick
 1996

210

Approximate distance oracles
– Mikkel Thorup, Uri Zwick

30

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

19

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

64

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

24

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

69

Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
– D. Aingworth, C. Chekuri, R. Motwani
 1996

13

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

60

Reach for A∗: Efficient pointtopoint shortest path algorithms
– Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
 2006

36

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

49

Undirected Single Source Shortest Paths in Linear Time
– Mikkel Thorup
 1997

159

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

9

Exact and approximate distances in graphs—a survey
– U Zwick
 2001

34

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

10

Finding realvalued singlesource shortest paths in o(n³) expected time
– Stavros G. Kolliopoulos, Clifford Stein
 1998

43

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