Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference53 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
2. On non-serial dynamic programming;Bertelé;J. Combin. Theory Ser. A,1973
3. Dynamic programming on graphs with bounded treewidth;Bodlaender,1988
4. A linear time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
5. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998