Concepedia

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

Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi

Discrete Applied Mathematics · 2008 · 14 citations · 11 references

DOI

Concepts

References

11

Graph Theory with Applications

E. Kay, J. A. Bondy, U. S. R. Murty · Operational Research Quarterly (1970-1977) · 1977 · 3K citations

, , +12

The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

Bruno Courcelle · Information and Computation · 1990 · 1.5K citations

, , +10

Matching, Euler tours and the Chinese postman

Jack Edmonds, Ellis L. Johnson · Mathematical Programming · 1973 · 987 citations

, , +1

Easy problems for tree-decomposable graphs

Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 874 citations

, , +9

Linear time algorithms for NP-hard problems restricted to partial k-trees

Stefan Arnborg, Andrzej Proskurowski · Discrete Applied Mathematics · 1989 · 579 citations

, , +8