Subexponential parameterized algorithm for minimum fill-in
From MaRDI portal
Recommendations
Cited in
(39)- Paths to trees and cacti
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Edge deletion problems: branching facilitated by modular decomposition
- Minimum fill-in: inapproximability and almost tight lower bounds
- Polynomial kernelization for removing induced claws and diamonds
- Quick but odd growth of cacti
- Searching for better fill-in
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- Polynomial kernelization for removing induced claws and diamonds
- Exploring the subexponential complexity of completion problems
- What's next? Future directions in parameterized complexity
- Large Induced Subgraphs via Triangulations and CMSO
- Reducing rank of the adjacency matrix by graph modification
- Reducing rank of the adjacency matrix by graph modification
- Faster Parameterized Algorithms for Minimum Fill-In
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- scientific article; zbMATH DE number 1775386 (Why is no real title available?)
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
- Confronting intractability via parameters
- Coverability and sub-exponential parameterized algorithms in planar graphs
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Editing to Connected F-Degree Graph
- Paths to trees and cacti
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Quadratic vertex kernel for split vertex deletion
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- A survey of parameterized algorithms and the complexity of edge modification
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- A revisited quadratic vertex-kernel for \textsc{Minimum Fill-In}
- Parameterized complexity of biclique contraction and balanced biclique contraction
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Rank reduction of oriented graphs by vertex and edge deletions
- Parameterized dynamic data structure for split completion
- An update on pushable homomorphisms
- The necessary and sufficient condition and the efficient algorithms for gradually varied fill
This page was built for publication: Subexponential parameterized algorithm for minimum fill-in
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408764)
