|
9
|
A shortest path algorithm for real-weighted undirected graphs
– Seth Pettie, Vijaya Ramachandran
- 1985
|
|
43
|
Exact and Approximate Distances in Graphs - a survey
– Uri Zwick
- 2001
|
|
69
|
On RAM priority queues
– Mikkel Thorup
- 1996
|
|
3
|
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
– Timothy M. Chan
|
|
2
|
A Practical Shortest Path Algorithm with Linear Expected Time
– Andrew V. Goldberg
- 2001
|
|
2
|
Melding Priority Queues
– Ran Mendelson, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
- 2004
|
|
14
|
Dynamic ordered sets with exponential search trees
– Arne Andersson, Mikkel Thorup
- 2002
|
|
43
|
Undirected Single Source Shortest Paths in Linear Time
– Mikkel Thorup
- 1997
|
|
|
Computing Undirected Shortest Paths with Comparisons and Additions
– Seth Pettie, Vijaya Ramachandran
- 2001
|
|
|
Directed Single-Source Shortest-Paths in Linear Average-Case Time
– Ulrich Meyer, Ulrich Meyer
- 2001
|
|
7
|
Parallel Shortest Path Algorithms for Solving . . .
– Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak
- 2006
|
|
5
|
Fast Algorithms for Shortest Paths and Sorting
– Rajeev Raman
- 1996
|
|
3
|
Heap-on-Top Priority Queues
– Boris V. Cherkassky, Krasikova St, Andrew V. Goldberg
- 1996
|
|
19
|
A New Approach to All-Pairs Shortest Paths on Real-Weighted Graphs
– Seth Pettie
- 2003
|
|
|
Low-Entropy Computational Geometry
– Wolfgang Johann Heinrich Mulzer
- 2010
|
|
24
|
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
– Ulrich Meyer
- 2001
|
|
29
|
A Simple Shortest Path Algorithm with Linear Average Time
– Andrew V. Goldberg
|
|
19
|
Shortest Path Algorithms: Engineering Aspects
– Andrew Goldberg
- 2001
|
|
10
|
I/O-efficient undirected shortest paths
– Ulrich Meyer, Norbert Zeh
- 2003
|
