Abstract
This paper deals with constrained cycle cover problem in Halin graphs. A (constrained) cycle cover of a graph is a set of cycles such that every (selected) vertex is in at least one cycle. This problem arises in the design fiber-optic telecommunication networks which employ a set of rings covering the network. Besides two types of minimum weight cycle cover problem, we also settle the problem of covering Halin graphs with an optimal 2-edge-connected subgraph. Linear time algorithms are given for all of the problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnborg, S., Lagergren, J.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–349 (1991)
Bondy, J.A., Murty, U.S.R.: Graph theory with application. Macmillan, London (1976)
Cornuejols, G., Naddef, D., Pulleyblank, W.: Halin graphs and the traveling salesman problem. Mathematical Programming 26, 287–294 (1983)
Cornuejols, G., Naddef, D., Pulleyblank, W.: The traveling salesman problem in graphs with 3-edge cutsets. Journal of ACM 32, 383–410 (1985)
Hochbaum, D.S., Olinick, E.V.: The bounded cycle-cover problem. INFORMS Journal on Computing 13, 104–119 (2001)
Li, Y.P., Lou, D.J., Lu, Y.T.: Algorithms for the optimal hamiltonian path in Halin graphs. Ars Combinatoria (accepted)
Pesant, G., Soriano, P.: An optimal strategy for the constrainted cycle cover problem. Annuals of Mathematics and Ariticial Intelligence 34, 313–325 (2002)
Winter, P.: Steiner problem in halin graphs. Discrete Apply. Math. 17, 281–294 (1987)
Wu, T.H.: Fiber network service survivability. Artech House, Norwood, MA (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y. (2007). Constrained Cycle Covers in Halin Graphs. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)