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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bachoore, E. H., & Bodlaender, H. L. (2006). A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4041 LNCS, pp. 255–266). Springer Verlag. https://doi.org/10.1007/11775096_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
