We develop practically efficient algorithms for computing the treewidth (formula presented) of a graph G. The core of our approach is a new dynamic programming algorithm which, given a graph G, a positive integer k, and a set (formula presented) of minimal separators of G, decides if G has a tree-decomposition of width at most k of a certain canonical form that uses minimal separators only from in the sense that the intersection of every pair of adjacent bags belongs to. This algorithm is used to show a lower bound of (formula presented), setting to be the set of all minimal separators of cardinality at most k and to show an upper bound of k on (formula presented) to be some, hopefully rich, set of such minimal separators. Combining this algorithm with new algorithms for exact and heuristic listing of minimal separators, we obtain exact algorithms for treewidth which overwhelmingly outperform previously implemented algorithms.
CITATION STYLE
Tamaki, H. (2019). Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11544 LNCS, pp. 219–236). Springer. https://doi.org/10.1007/978-3-030-34029-2_15
Mendeley helps you to discover research relevant for your work.