Abstract
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,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.
Work was supported in part by a fellowship from Infosys Technologies, Bangalore.
Work was supported in part by an IBM Faculty Partnership award
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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.
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.
Edith Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput., 28:210–236, 1998.
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.
David Peleg and Eli Upfal. A trade-off 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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baswana, S., Sen, S. (2003). A Simple Linear Time Algorithm for Computing a (2k — 1)-Spanner of O(n 1+1/k) Size in Weighted Graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive