A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
From MaRDI portal
Publication:5434404
DOI10.1007/11775096_24zbMath1137.68465DBLPconf/aaim/BachooreB06OpenAlexW1572383262WikidataQ59567797 ScholiaQ59567797MaRDI QIDQ5434404
Emgad H. Bachoore, Hans L. Bodlaender
Publication date: 4 January 2008
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/22180
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
An extended depth-first search algorithm for optimal triangulation of Bayesian networks ⋮ Weighted Treewidth Algorithmic Techniques and Results ⋮ A Local Search Algorithm for Branchwidth ⋮ Encoding Treewidth into SAT ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
This page was built for publication: A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
