Constrained cycle covers in Halin graphs

Authors:
Yueping Li
Affiliations:
Department of Computer Science, Sun Yat-sen University, Guangzhou, P. R. China
Venue:
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Year:
2007

Citing 7
Cited 0

The traveling salesman problem in graphs with 3-edge cutsets

Journal of the ACM (JACM)
Steiner problem in Halin networks

Discrete Applied Mathematics
Easy problems for tree-decomposable graphs

Journal of Algorithms
Fiber Network Service Survivability

Fiber Network Service Survivability
An Optimal Strategy for the Constrained Cycle Cover Problem

Annals of Mathematics and Artificial Intelligence
The Bounded Cycle-Cover Problem

INFORMS Journal on Computing
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

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.