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

DOI10.1007/11682462_73MaRDI QIDQ3525813zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Automata, Languages and Programming
• Exact Algorithms for Treewidth and Minimum Fill-In
• On Exact Algorithms for Treewidth
• Treewidth Computation and Extremal Combinatorics
• On exact algorithms for treewidth

Cited in

(13)

• Treewidth computation and extremal combinatorics
• An exact algorithm for the minimum dominating clique problem
• On the number of minimal separators in graphs
• Finding induced subgraphs via minimal triangulations
• Exact Algorithms for Edge Domination
• Characterizing and Computing Minimal Cograph Completions
• Exact Algorithms for Treewidth and Minimum Fill-In
• Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
• Automata, Languages and Programming
• Tangle bases: Revisited
• A note on exact algorithms for vertex ordering problems on graphs
• Computing branchwidth via efficient triangulations and blocks
• Characterizing and computing minimal cograph completions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525813)