Skip to main content
SpringerLink
Log in

Distance approximating spanning trees

  • Algorithms III
  • Conference paper
  • First Online:
STACS 97 (STACS 1997)

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

Included in the following conference series:

Abstract

A spanning tree of a graph is distance k-approximating whenever the distance of every two vertices in the graph or in the tree differs by at most k. Variants or modifications of a simple approach yield distance k-approximating spanning trees for block graphs, interval graphs, distance-hereditary graphs, and cocomparability graphs, with k=1,2,2,4. On the other hand, there are chordal graphs without distance k-approximating spanning tree for arbitrary large k.

On leave from the Mathematisches Seminar, Universität Hamburg, Bundesstr. 55, 20146 Hamburg, Germany; supported by the DFG under grant no. Pr 324/6-1.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.-J. Bandelt, H.M. Mulder, Distance-hereditay graphs, J. Combin. Th. B 41 (1986) 182–208.

    Article  Google Scholar 

  2. L. Cai, D.G. Corneil, Tree spanners, SIAM J. Discr. Math. 8 (1995) 359–387.

    Article  Google Scholar 

  3. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London (1980).

    Google Scholar 

  4. P.L. Hammer, F. Maffray, Completely separable graphs, Discrete Appl. Math. 27 (1990) 85–99.

    Article  Google Scholar 

  5. C. Lekkerkerker, J. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51 (1962) 45–64.

    Google Scholar 

  6. A.L. Liestman, T. Shermer, Additive graph spanners, Networks 23 (1993) 343–364.

    Google Scholar 

  7. J. Spinrad, On comparability and permutation graphs, SIAM J. Computing 14 (1985) 658–670.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Clemson University, 29631, Clemson, SC, USA

    Erich Prisner

Authors
  1. Erich Prisner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rüdiger Reischuk Michel Morvan

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prisner, E. (1997). Distance approximating spanning trees. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023484

Download citation

  • DOI: https://doi.org/10.1007/BFb0023484

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62616-9

  • Online ISBN: 978-3-540-68342-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation