Exact Algorithms for Treewidth and Minimum Fill-In

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Extremal problems in graph theory (05C35)

Recommendations

Automata, Languages and Programming
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
On treewidth and minimum fill-in of asteroidal triple-free graphs
On Exact Algorithms for Treewidth
Treewidth Computation and Extremal Combinatorics

Cited in

(48)

Positive-instance driven dynamic programming for treewidth
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
\(k\)-universality of regular languages
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
On the number of minimal separators in graphs
A note on exact algorithms for vertex ordering problems on graphs
On Exact Algorithms for Treewidth
scientific article; zbMATH DE number 7764113 (Why is no real title available?)
The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
On listing, sampling, and counting the chordal graphs with edge constraints
Treewidth computation and extremal combinatorics
Acyclic and star colorings of cographs
Computing hypergraph width measures exactly
Positive-instance driven dynamic programming for treewidth
Approximately counting locally-optimal structures
scientific article; zbMATH DE number 7053390 (Why is no real title available?)
Treewidth of Chordal Bipartite Graphs
Treewidth Computation and Extremal Combinatorics
Tangle bases: Revisited
A survey of parameterized algorithms and the complexity of edge modification
On the complexity of computing treelength
On the maximum weight minimal separator
Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
Finding optimal triangulations parameterized by edge clique cover
Finding a maximum minimal separator: graph classes and fixed-parameter tractability
On the hardness of inclusion-wise minimal separators enumeration
On exact algorithms for treewidth
On cutwidth parameterized by vertex cover
Automata, Languages and Programming
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
On cutwidth parameterized by vertex cover
On the maximum weight minimal separator
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
k-universality of regular languages
Computing tree-depth faster than \(2^n\)
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
Strongly chordal and chordal bipartite graphs are sandwich monotone
Constructing Brambles
Faster parameterized algorithms for \textsc{Minimum Fill-in}
Large Induced Subgraphs via Triangulations and CMSO
A revisit of the scheme for computing treewidth and minimum fill-in
Treewidth and minimum fill-in: Grouping the minimal separators
scientific article; zbMATH DE number 1696522 (Why is no real title available?)
Approximately Counting Locally-Optimal Structures
Computing the treewidth and the minimum fill-in with the modular decomposition
Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
Exact algorithms for edge domination
Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs

This page was built for publication: Exact 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 Q3631902)