Skip to main content
SpringerLink
Log in

A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees

  • Conference paper
Intelligent Information Technology (CIT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3356))

Included in the following conference series:

  • 752 Accesses

Abstract

A spanning tree T of a graph G is said to be a tree t -spanner if the distance between any two vertices in T is at most t times their distance in G. A graph that has a tree t-spanner is called a tree t -spanner admissible graph. It has been shown in [3] that the problem of recognizing whether a graph admits a tree t-spanner is NP-complete for t ≥ 4. In this paper, we present a linear time algorithm for constructing a tree 4-spanner in a tree 4-spanner admissible 2-tree.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On Sparse Spanner of Weighted Graphs. Discrete Comput.Geom. 9, 81–100 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barthéy, J.P., Guéoche, A.: Trees and Proximity Representations. Wiley, New York (1991)

    Google Scholar 

  3. Bhatt, S., Chung, F., Leighton, F., Rosenberg, A.: Optimal Simulation of Tree Machines. In: Proc. 27th IEEE Foundations of Computer Science, Toronto, pp. 274–282 (1986)

    Google Scholar 

  4. Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Brandstadt, A., Chepoi, V., Dragan, F.: Distance approximating trees for chordal and dually chordal graphs. Journal of Algorithms 30, 166–184 (1999)

    Article  MathSciNet  Google Scholar 

  6. Cai, L., Corneil, D.G.: Tree Spanners: an Overview. Congressus Numerantium 88, 65–76 (1992)

    MathSciNet  Google Scholar 

  7. Cai, L., Keil, J.M.: Degree-Bounded Spanners. Parallel Processing Letters 3, 457–468 (1993)

    Article  MathSciNet  Google Scholar 

  8. Cai, L., Keil, J.M.: Spanners in Graphs of Bounded Degree. Networks 24, 187–194 (1994)

    Article  MathSciNet  Google Scholar 

  9. Cai, L.: NP-completeness of Minimum Spanner Problems. Disc. Appl. Math. 48, 187–194 (1994)

    Article  MATH  Google Scholar 

  10. Cai, L., Corneil, D.G.: Tree Spanners. SIAM J. Discrete Math. 8, 359–387 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chew, L.P.: There Are Planar Graphs Almost As Good As the Complete Graph. J. Comput. Syst. Sci. 39, 205–219 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Courcelle, B.: Recognizability and Second-Order Definability for Sets of Finite Graphs. Information and Computation 85, 12–75 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  13. Fekete, S.P., Kremner, J.: Tree Spanners in Planar Graphs. Discrete Applied Mathematics 108, 85–103 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  15. Liestman, A.L., Schermer, T.C.: Grid Spanners. Networks 23(2), 123–133 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Liestman, A.L., Shermer, T.C.: Additive Graph Spanner. Networks 23, 343–364 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  17. Madanlal, M.S., Venkatesan, G., Rangan, C.P.: Tree 3-spanners on Interval, Permutation and Regular Bipartite Graphs. Infor. Proc. Lett. 59, 97–102 (1996)

    Article  MATH  Google Scholar 

  18. Narasimhan, G., Chandra, B., Gautam, D., Soares, J.: New Sparseness Results on Graph Spanners. In: Proc. 8th Annual ACM Symposium on Computational Geometry, pp. 192–201 (1992)

    Google Scholar 

  19. Panda, B.S., Das, S.K.: A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds.) Proceedings of 2nd IFIP Interntional Conference on Theoretical Computer Science (TCS 2002), pp. 292–309. Kluwer Academic Pub, Dordrecht (2002)

    Google Scholar 

  20. Panda, B.S., Das, A.: A linear time algorithm for finding Tree 4-spanner in 2-trees. (Manuscript), Dept. of Mathematics, Indian Institute of Technology Delhi, pp. 1–19 (2004)

    Google Scholar 

  21. Peleg, D., Ullman, J.D.: An Optimal Synchronizer for the Hypercube. In: Proceedings of the 6th ACM Symposium on principles of Distributed computing, Vancouver, pp. 77–85 (1987)

    Google Scholar 

  22. Peleg, D., Upfal, E.: A Trade Off Between Space and Efficiency for Routing Tables. In: Proceedings of the 20th ACM Symposium on Theory of Computing, Chicago, pp. 43–52 (1988)

    Google Scholar 

  23. Peleg, D., Schäffer, A.A.: Graph spanners. J. Graph Theory 13, 99–116 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sneath, P.H.A., Sokal, R.R.: Numerical Taxonomy, San Francisco (1973)

    Google Scholar 

  25. Swofford, D.L., Olsen, G.J.: Phylogeny reconstruction. In: Hills, D.M., Moritz, C. (eds.) Molecular Systematics, pp. 411–501 (1990) (Sinauer Associates, Sunderland)

    Google Scholar 

  26. Venkatesan, G., Rotics, U., Madanlal, M., Makowsky, J.A., Rangan, C.P.: Restrictions of Minimum Spanner Problems. Information and computation 136(2), 143–164 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110 016, India

    B. S. Panda & Anita Das

Authors
  1. B. S. Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anita Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sc and Engineering, University of Texas At Arlington, TX-76019, Arlington

    Gautam Das

  2. Tata Consultancy Services, Software Units Layout, Madhapur, 500081, Hyderabad, India

    Ved Prakash Gulati

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panda, B.S., Das, A. (2004). A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. In: Das, G., Gulati, V.P. (eds) Intelligent Information Technology. CIT 2004. Lecture Notes in Computer Science, vol 3356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30561-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30561-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24126-3

  • Online ISBN: 978-3-540-30561-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation