Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Short cycle covers and the cycle double cover conjecture
Journal of Combinatorial Theory Series B
On the Complexity of Finding a Minimum Cycle Cover of a Graph
SIAM Journal on Computing
On the complexity of edge traversing
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
On the Circuit Cover Problem for Mixed Graphs
Combinatorics, Probability and Computing
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 0.04 |
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={C"1,...,C"k} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is @?"i"="1^k|C"i|. 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 minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width.