Minimum Size Tree-decompositions☆
References (11)
The monadic second-order logic of graphs. i. recognizable sets of finite graphs
Information and Computation
(1990)- et al.
Graph minors. ii. algorithmic aspects of tree-width
J. Algorithms
(1986) - et al.
Complexity of finding embeddings in a k-tree
SIAM J. Algebraic Discrete Methods
(1987) - et al.
Characterization and recognition of partial 3-trees
SIAM J. Algebraic Discrete Methods
(1986) A linear-time algorithm for finding tree-decompositions of small treewidth
SIAM J. Comput.
(1996)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This work has been partially supported by ANR project Stint (ANR-13-BS02-0007), the associated Inria team AlDyNet, the project ECOS-Sud Chile and a grant from the ”Conseil régional Provence Alpes-Côte d'Azur”.
Copyright © 2015 Elsevier B.V. All rights reserved.