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 roperties of the adopted branching strategy. We discuss how the algorithm can not only be used to
... read more