Skip to main content
Article thumbnail
Location of Repository

A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth

By E.H. Bachoore and H.L. Bodlaender


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 roperties 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

Topics: Wiskunde en Informatica
Year: 2006
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.