All-pairs small-stretch paths

Edith Cohen*, Uri Zwick

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

Let G = (V, E) be a weighted undirected graph. A path between u, v ∈ V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding small-stretch paths between all pairs of vertices in the graph G. It is easy to see that finding paths of stretch less than 2 between all pairs of vertices in an undirected graph with n vertices is at least as hard as the Boolean multiplication of two n×n matrices. We describe three algorithms for finding small-stretch paths between all pairs of vertices in a weighted graph with n vertices and m edges. The first algorithm, STRETCH2, runs in Ō(n3/2m1/2) time and finds stretch 2 paths. The second algorithm, STRETCH7/3, runs in Ō(n7/3) time and finds stretch 7/3 paths. Finally, the third algorithm, STRETCH3, runs in Ō(n2) and finds stretch 3 paths. Our algorithms are simpler, more efficient and more accurate than the previously best algorithms for finding small-stretch paths. Unlike all previous algorithms, our algorithms are not based on the construction of sparse spanners or sparse neighbourhood covers.

Original languageEnglish
Pages93-102
Number of pages10
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA, USA
Duration: 5 Jan 19977 Jan 1997

Conference

ConferenceProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms
CityNew Orleans, LA, USA
Period5/01/977/01/97

Fingerprint

Dive into the research topics of 'All-pairs small-stretch paths'. Together they form a unique fingerprint.

Cite this