Subexponential parameterized algorithm for minimum fill-in
DOI10.1137/11085390XzbMATH Open1285.68055DBLPjournals/siamcomp/FominV13WikidataQ56430107 ScholiaQ56430107MaRDI QIDQ5408764FDOQ5408764
Authors: Fedor V. Fomin, Yngve Villanger 
Publication date: 11 April 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (34)
- Coverability and sub-exponential parameterized algorithms in planar graphs
- Title not available (Why is that?)
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering
- Quick but odd growth of cacti
- Paths to trees and cacti
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- What's next? Future directions in parameterized complexity
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- Edge deletion problems: branching facilitated by modular decomposition
- Reducing rank of the adjacency matrix by graph modification
- Searching for better fill-in
- Rank reduction of oriented graphs by vertex and edge deletions
- Paths to trees and cacti
- Title not available (Why is that?)
- Faster Parameterized Algorithms for Minimum Fill-In
- A survey of parameterized algorithms and the complexity of edge modification
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Quadratic vertex kernel for split vertex deletion
- The necessary and sufficient condition and the efficient algorithms for gradually varied fill
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Minimum fill-in: inapproximability and almost tight lower bounds
- Confronting intractability via parameters
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- Reducing rank of the adjacency matrix by graph modification
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
- Exploring the subexponential complexity of completion problems
- Polynomial kernelization for removing induced claws and diamonds
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Large Induced Subgraphs via Triangulations and CMSO
- Editing to Connected F-Degree Graph
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- Polynomial kernelization for removing induced claws and diamonds
- Title not available (Why is that?)
- A Subexponential Parameterized Algorithm for Proper Interval Completion
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)
