Publisher
Springer International Publishing
Reference37 articles.
1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987). https://doi.org/10.1137/0608024.
2. Bertelè, U., Brioschi, F.: Nonserial Dynamic Programming. Elsevier (1972)
3. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11(1–2), 1–21 (1993). https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3417
4. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996). https://doi.org/10.1137/S0097539793251219.
5. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1), 1–45 (1998). https://doi.org/10.1016/S0304-3975(97)00228-4. https://www.sciencedirect.com/science/article/pii/S0304397597002284