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

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Report , Article 01 Jan 2006 Netherlands Publisher:Springer Berlin Heidelberg

Authors: Emgad H. Bachoore; Hans L. Bodlaender;

doi: 10.1007/11775096_24

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

- Summary
- Metrics

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.

Country

Netherlands

Related Organizations

Utrecht University
Netherlands

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	12
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%