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}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Graph Theory

  • R. Diestel
  • second edn, in: Graduate Texts in Mathematics…
  • 2000
1 Excerpt

Tree width and tangles: A new connectivity measure and some applications

  • B. Reed
  • in: Surveys in Combinatorics, , London, in…
  • 1997
1 Excerpt

Network Flows

  • R. K. Ahuja, T. L. Magnantie, J. B. Orlin
  • Prentice-Hall
  • 1993
1 Excerpt

Monadic 2 nd - order evaluations on tree - decomposable graphs , Theoret

  • M. Mosbah Courcelle
  • Comput . Sci .
  • 1990