Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In

DOI10.1007/11682462_73zbMath1145.68475OpenAlexW1584965761MaRDI QIDQ3525813

Yngve Villanger

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_73

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Treewidth computation and extremal combinatorics ⋮ Exact Algorithms for Edge Domination ⋮ Tangle bases: Revisited ⋮ Characterizing and Computing Minimal Cograph Completions ⋮ An exact algorithm for the minimum dominating clique problem ⋮ A note on exact algorithms for vertex ordering problems on graphs ⋮ Computing branchwidth via efficient triangulations and blocks ⋮ Characterizing and computing minimal cograph completions ⋮ On the Number of Minimal Separators in Graphs

This page was built for publication: Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In