Spanning 2-trees

  • Leizhen Cai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1023)


A k-tree is defined recursively to be either a K-clique or a graph T that contains a vertex v whose neighbourhood in T induces a k-clique and whose removal results in a k-tree. The existence of a spanning k-tree in a communication network is closely related to the reliability of the network, and it is known that the problem of determining whether a graph contains a spanning k-tree is NP-complete for any fixed k ≥2. In this paper, several sufficient conditions are given for the existence of spanning 2-trees in a graph. An approximation algorithm is presented for finding a spanning 2-tree with minimum weight in a weighted complete graph. The asymptotic performance ratio of the algorithm is 2 when edge weights satisfy the triangle inequality, and 1.655 when the graph is a complete Euclidean graph on a set of points in the plane. It is also shown that it is NP-complete to determine whether a graph admits a spanning 2-tree that contains a given spanning tree.

Key words

Graph algorithm panning K-tree approximation algorithm NP-completeness 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M.W. Bern. Network design problems: Steiner trees and spanning k-trees. PhD thesis, University of California, Berkeley, 1987.Google Scholar
  2. 2.
    J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, New York, 1976.Google Scholar
  3. 3.
    L. Cai. Tree Spanners: Spanning Trees that Approximate Distances. Ph.D. Dissertation, Technical Report 260/92, Department of Computer Science, University of Toronto, 1992.Google Scholar
  4. 4.
    L. Cai and D.G. Corneil. Tree spanners. SIAM J. of Discrete Math., to appear, 1995.Google Scholar
  5. 5.
    L. Cai and F. Maffray. On the spanning k-tree problem. Disc. Appl. Math., 44:139–156, 1993.Google Scholar
  6. 6.
    D.Z. Du and F.K. Hwang. A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Algorithmica, 7:121–135, 1992.Google Scholar
  7. 7.
    A.M. Farley. Networks immune to isolated failures. Networks, 11:255–268, 1981.Google Scholar
  8. 8.
    H.N. Gabow, Z. Galil, T.H. Spencer, and R.E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6 (2):109–122, 1986.Google Scholar
  9. 9.
    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, San Fransisco, 1979.Google Scholar
  10. 10.
    R.E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1983.Google Scholar
  11. 11.
    W.T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99–116, 1956.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Leizhen Cai
    • 1
  1. 1.Department of Computer Science and EngineeringThe Chinese University of Hong KongShatin, New TerritoriesHong Kong

Personalised recommendations