Treewidth Lower Bounds with Brambles
Open Access
- 6 October 2007
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 51 (1) , 81-98
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Safe separators for treewidthDiscrete Mathematics, 2006
- Contraction and Treewidth Lower BoundsJournal of Graph Algorithms and Applications, 2006
- PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS*Computational Intelligence, 2005
- Discovering Treewidth2005
- Contraction and Treewidth Lower BoundsLecture Notes in Computer Science, 2004
- On the Maximum Cardinality Search Lower Bound for Treewidth2004
- Two Short Proofs Concerning Tree-DecompositionsCombinatorics, Probability and Computing, 2002
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987