Header menu link for other important links
A simple linear time algorithm for computing a (2k - 1)-spanner of O(n1+1/k) size in weighted graphs
S. Baswana,
Published in Springer Verlag
Volume: 2719
Pages: 384 - 396
Let G(V, E) be an undirected weighted graph with |V| = n, and |E| = m. A t-spanner of the graph G(V, E) is a sub-graph G(V, Es) such that the distance between any pair of vertices in the spanner is at most t times the distance between the two in the given graph. A 1963 girth conjecture of Erdos implies that Ω(n1+1/k) edges are required in the worst case for any (2k - 1)-spanner, which has been proved for k = 1, 2, 3, 5. There exist polynomial time algorithms that can construct spanners with the size that matches this conjectured lower bound, and the best known algorithm takes O(mn1/k) expected running time. In this paper, we present an extremely simple linear time randomized algorithm that constructs (2k - 1)-spanner of size matching the conjectured lower bound. Our algorithm requires local information for computing a spanner, and thus can be adapted suitably to obtain efficient distributed and parallel algorithms. © Springer-Verlag Berlin Heidelberg 2003.
About the journal
Published in Springer Verlag
Open Access
Impact factor