Highly Influenced

# Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

@article{Fernandes2009MinimumCC, title={Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width}, author={Cristina G. Fernandes and Orlando Lee and Yoshiko Wakabayashi}, journal={Discrete Applied Mathematics}, year={2009}, volume={157}, pages={272-279} }

- Published in Discrete Applied Mathematics 2009
DOI:10.1016/j.dam.2007.10.032

Let M = (V, E, A) be a mixed graph with vertex set V , edge set E and arc set A. A cycle cover of M is a family C = {C1, . . . , Ck} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is ∑k i=1 |Ci |. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M , find a… CONTINUE READING