Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–340 (1991)
2. Bixby, R.: A composition for perfect graphs. Annals of Discrete Math. 21, 221–224 (1984)
3. Lecture Notes in Computer Science;H.L. Bodlaender,2003
4. Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nord. J. Comput. 7, 14–31 (2000)
5. Bodlaender, H.L., Rotics, U.: Computing the treewidth and the minimum fill-in with the modular decomposition. Algorithmica 36, 375–408 (2003)