A Simple Linear Time Algorithm for Computing a (2k — 1)Spanner of O(n ^{1+1/k }) Size in Weighted Graphs
 Surender Baswana,
 Sandeep Sen
 … show all 2 hide
Abstract
Let G(V,E) be an undirected weighted graph with V = n, and E = m. A tspanner of the graph G(V,E) is a subgraph G(V,E _{S}) 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 Ω(n ^{1+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(mn ^{1/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.
 I. Althofer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete and Computational Geometry, 9:81–100, 1993. CrossRef
 B. Awerbuch. Complexity of network synchronization. Journal of Ass. Compt. Mach., pages 804–823, 1985.
 H. J. Bandelt and A. W. M. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Journal of Advances of Applied Mathematics, 7:309–343, 1986. CrossRef
 B. Bollobas. In Extremal Graph Theory, page 164. Academic Press, 1978.
 J.A. Bondy and M. Simonovits. Cycle of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97–105, 1974. CrossRef
 Edith Cohen. Fast algorithms for constructing tspanners and paths with stretch t. SIAM J. Comput., 28:210–236, 1998. CrossRef
 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.
 Shay Halperin and Uri Zwick. Unpublished result. 1996.
 David Peleg and A. A. Schaffer. Graph spanners. Journal of Graph Theory, 13:99–116, 1989. CrossRef
 David Peleg and Eli Upfal. A tradeoff between space amd efficiency for routing tables. Journal of Assoc. Comp. Mach., 36(3):510–530, 1989.
 Mikkel Thorup and Uri Zwick. Approximate distance oracle. In Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), pages 183–192, 2001.
 Uri Zwick. Personal communication.
 Title
 A Simple Linear Time Algorithm for Computing a (2k — 1)Spanner of O(n ^{1+1/k }) Size in Weighted Graphs
 Book Title
 Automata, Languages and Programming
 Book Subtitle
 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 – July 4, 2003 Proceedings
 Pages
 pp 384396
 Copyright
 2003
 DOI
 10.1007/3540450610_32
 Print ISBN
 9783540404934
 Online ISBN
 9783540450610
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 2719
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Keywords

 Graph algorithms
 Randomized algorithms
 Shortest path
 Industry Sectors
 eBook Packages
 Editors

 Jos C. M. Baeten ^{(1)}
 Jan Karel Lenstra ^{(2)}
 Joachim Parrow ^{(3)}
 Gerhard J. Woeginger ^{(4)}
 Editor Affiliations

 1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven
 2. School of Industrial and Systems Engineering, Georgia Institute of Technology
 3. Department of Information Technology, Uppsala University
 4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente
 Authors

 Surender Baswana ^{(5)}
 Sandeep Sen ^{(5)}
 Author Affiliations

 5. Department of Computer Science and Engineering, I.I.T. Delhi, Hauz Khas, New Delhi, 110016, India
Continue reading...
To view the rest of this content please follow the download PDF link above.