2 search results - page 1 / 1 » Fast Estimation of Diameter and Shortest Paths (without Matr... |
SODA
1996
ACM
15 years 4 months ago
1996
ACM
139
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...