Abstract
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.
This work was partially supported by a Direct Grant for Research from the Chinese University of Hong Kong and an Earmarked Research Grant from the Research Grants Council of Hong Kong.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.W. Bern. Network design problems: Steiner trees and spanning k-trees. PhD thesis, University of California, Berkeley, 1987.
J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, New York, 1976.
L. Cai. Tree Spanners: Spanning Trees that Approximate Distances. Ph.D. Dissertation, Technical Report 260/92, Department of Computer Science, University of Toronto, 1992.
L. Cai and D.G. Corneil. Tree spanners. SIAM J. of Discrete Math., to appear, 1995.
L. Cai and F. Maffray. On the spanning k-tree problem. Disc. Appl. Math., 44:139–156, 1993.
D.Z. Du and F.K. Hwang. A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Algorithmica, 7:121–135, 1992.
A.M. Farley. Networks immune to isolated failures. Networks, 11:255–268, 1981.
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.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, San Fransisco, 1979.
R.E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1983.
W.T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99–116, 1956.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, L. (1995). Spanning 2-trees. In: Kanchanasut, K., Lévy, JJ. (eds) Algorithms, Concurrency and Knowledge. ACSC 1995. Lecture Notes in Computer Science, vol 1023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60688-2_31
Download citation
DOI: https://doi.org/10.1007/3-540-60688-2_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60688-8
Online ISBN: 978-3-540-49262-7
eBook Packages: Springer Book Archive