Login / Signup
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.
Surender Baswana
Telikepalli Kavitha
Published in:
SIAM J. Comput. (2010)
Keyphrases
</>
shortest path
shortest path algorithm
undirected graph
minimum cost flow
worst case
computational complexity
gray level