A branch and bound algorithm for exact, upper, and lower bounds on treewidth

Authors:
Emgad H. Bachoore;Hans L. Bodlaender
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands;Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
Venue:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 8
Cited 7

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
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 sufficiently fast algorithm for finding close to optimal clique trees

Artificial Intelligence
Efficient Approximation for Triangulation of Minimum Treewidth

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Safe Reduction Rules for Weighted Treewidth

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A complete anytime algorithm for treewidth

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Solving problems on recursively constructed graphs

ACM Computing Surveys (CSUR)
Treewidth: structure and algorithms

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Weighted treewidth algorithmic techniques and results

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A local search algorithm for branchwidth

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Treewidth: characterizations, applications, and computations

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On exact algorithms for treewidth

ACM Transactions on Algorithms (TALG)
Evaluating tree-decomposition based algorithms for answer set programming

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, a branch and bound algorithm for computing the treewidth of a graph is presented. The method incorporates extensions of existing results, and uses new pruning and reduction rules, based upon properties of the adopted branching strategy. We discuss how the algorithm can not only be used to obtain exact bounds for the treewidth, but also to obtain upper and/or lower bounds. Computational results of the algorithm are presented.