Author:
Paul Christophe,Proskurowski Andrzej,Telle Jan Arne
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Bodlaender, H.L., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. SIAM J. Computing 25, 1305–1317 (1996)
2. Lecture Notes in Computer Science;H.L. Bodlaender,1997
3. Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. Journal of Algorithms 32, 167–194 (1999)
4. Cook, W., Seymour, P.D.: Tour merging via branch-decompositions. Journal on Computing 15, 233–248 (2003)
5. Lecture Notes in Computer Science;E. Demaine,2003