Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Linear algorithms for graphs of tree-width at most four
Linear algorithms for graphs of tree-width at most four
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
The Structure and Number of Obstructions to Treewidth
SIAM Journal on Discrete Mathematics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Multiplicities of eigenvalues and tree-width of graphs
Journal of Combinatorial Theory Series B
The structure of obstructions to treewidth and pathwidth
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
A New Lower Bound for Tree-Width Using Maximum Cardinality Search
SIAM Journal on Discrete Mathematics
Dynamic programming, tree-width and computation on graphical models
Dynamic programming, tree-width and computation on graphical models
A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
New lower and upper bounds for graph treewidth
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the maximum cardinality search lower bound for treewidth
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics
| Hi-index | 0.05 |
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW=