|
31
|
All-Pairs Small-Stretch Paths
– Edith Cohen, Uri Zwick
- 1997
|
|
64
|
All Pairs Almost Shortest Paths
– Dorit Dor, Shay Halperin, Uri Zwick
- 1996
|
|
9
|
A shortest path algorithm for real-weighted undirected graphs
– Seth Pettie, Vijaya Ramachandran
- 1985
|
|
154
|
Approximate Distance Oracles
– Mikkel Thorup , Uri Zwick
- 2001
|
|
8
|
Low Distortion Spanners
– Seth Pettie
|
|
2
|
Additive Spanners and (α, β)-Spanners
– Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
|
|
|
Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs
– Sairam Subramanian, Sairam Subramanian, Philip N. Klein, Roberto Tamassia, Jeffrey S. Vitter
- 1995
|
|
7
|
All Pairs Lightest Shortest Paths
– Uri Zwick
- 1999
|
|
46
|
All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication
– Uri Zwick
- 2000
|
|
|
All-Pairs Shortest Paths with a Sublinear Additive Error
– Liam Roditty, Asaf Shapira
|
|
10
|
Lower Bounds for Additive Spanners, Emulators, and More
– David P. Woodruff
|
|
|
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
– Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
- 2008
|
|
2
|
Transitive-Closure Spanners: A Survey
– Sofya Raskhodnikova
|
|
2
|
Finding Sparser Directed Spanners
– Piotr Berman, Sofya Raskhodnikova, Ge Ruan
|
|
19
|
Shortest Path Algorithms: Engineering Aspects
– Andrew Goldberg
- 2001
|
|
1
|
Constructing the Spanners of Graphs in Parallel
– Weifa Liang, Richard P. Brent
- 1996
|
|
2
|
New approximation algorithms for minimum cycle bases of graphs
– Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
- 2007
|
|
2
|
A Practical Shortest Path Algorithm with Linear Expected Time
– Andrew V. Goldberg
- 2001
|
|
29
|
A Simple Shortest Path Algorithm with Linear Average Time
– Andrew V. Goldberg
|