A Simple Linear Time Algorithm for Computing a (2k — 1)-Spanner of O(n1+1/k) Size in Weighted Graphs
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 Erdős 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.
KeywordsGraph algorithms Randomized algorithms Shortest path
Unable to display preview. Download preview PDF.
- 2.B. Awerbuch. Complexity of network synchronization. Journal of Ass. Compt. Mach., pages 804–823, 1985.Google Scholar
- 4.B. Bollobas. In Extremal Graph Theory, page 164. Academic Press, 1978.Google Scholar
- 7.P. Erdos. Extremal problems in graph theory. In In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29–36. Publ. House Czechoslovak Acad. Sci., Prague, 1964, 1963.Google Scholar
- 8.Shay Halperin and Uri Zwick. Unpublished result. 1996.Google Scholar
- 11.Mikkel Thorup and Uri Zwick. Approximate distance oracle. In Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), pages 183–192, 2001.Google Scholar
- 12.Uri Zwick. Personal communication.Google Scholar