|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
493
|
Fibonacci heaps and their uses in improved network optimization algorithms
– M L Fredman, R E Tarjan
- 1987
|
|
1011
|
A Note on Two Problems in Connexion with Graphs
– E. W. Dijkstra
- 1959
|
|
64
|
All Pairs Almost Shortest Paths
– Dorit Dor, Shay Halperin, Uri Zwick
- 1996
|
|
58
|
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
– D. Aingworth, C. Chekuri, R. Motwani
- 1996
|
|
154
|
Approximate Distance Oracles
– Mikkel Thorup , Uri Zwick
- 2001
|
|
58
|
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
– David R. Karger, Daphne Koller, Steven J. Phillips
- 1993
|
|
22
|
Improved shortest paths on the word RAM
– T Hagerup
|
|
27
|
A scaling algorithm for weighted matching on general graphs
– H N Gabow
- 1985
|
|
16
|
Computing Shortest Paths with Comparisons and Additions
– Seth Pettie , Vijaya Ramachandran
- 2002
|
|
11
|
Experimental Evaluation of a New Shortest Path Algorithm
– Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
- 2001
|
|
43
|
Undirected Single Source Shortest Paths in Linear Time
– Mikkel Thorup
- 1997
|
|
30
|
An all pairs shortest path algorithm with expected time O(n 2 log n
– A Moffat, T Takaoka
- 1987
|
|
119
|
Efficient Algorithms for Shortest Paths in Sparse Networks
– D B Johnson
- 1977
|
|
196
|
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
– Jure Leskovec, Jon Kleinberg, Christos Faloutsos
- 2005
|
|
29
|
A Simple Shortest Path Algorithm with Linear Average Time
– Andrew V. Goldberg
|
|
51
|
New bounds on the complexity of the shortest path Problem
– Michael L Fredman
- 1976
|
|
10
|
Finding real-valued single-source shortest paths in o(n³) expected time
– Stavros G. Kolliopoulos, Clifford Stein
- 1998
|
|
37
|
A new upper bound on the complexity of the all pairs shortest path problem
– Tadao Takaoka
- 1992
|
