A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Achievable sets, brambles, and sparse treewidth obstructions
Discrete Applied Mathematics
On the maximum cardinality search lower bound for treewidth
Discrete Applied Mathematics
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Treewidth computations II. Lower bounds
Information and Computation
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Degree-Based treewidth lower bounds
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient 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
| Hi-index | 0.00 |
The tree-width of a graph is of great importance in applied problems in graphical models. The complexity of inference problems on Markov random fields is exponential in the tree-width of the graph. However, computing tree-width is NP-hard in general. Easily computable upper bounds exist, but there are few lower bounds. We give a novel technique to compute a lower bound for the tree-width of a graph using maximum cardinality search. This bound is efficiently computable and is guaranteed to do at least as well as finding the largest clique in the graph.