Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference34 articles.
1. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
2. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
3. Dynamic programming on graphs with bounded treewidth;Bodlaender,1988
4. A tourist guide through treewidth;Bodlaender;Acta Cybern.,1993