Subexponential parameterized algorithm for minimum fill-in

@inproceedings{Fomin2012SubexponentialPA,
  title={Subexponential parameterized algorithm for minimum fill-in},
  author={F. Fomin and Yngve Villanger},
  booktitle={SODA},
  year={2012}
}
  • F. Fomin, Yngve Villanger
  • Published in SODA 2012
  • Computer Science, Mathematics
  • The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + k2nm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterizedv algorithm solving Minimum Fill-in in time [EQUATION]. This substantially lowers the complexity of the problem. Techniques developed for Minimum Fill-in can be used to… CONTINUE READING
    79 Citations
    Searching for better fill-in
    Searching for better fill-in
    • 1
    • PDF
    Subexponential Parameterized Algorithm for Interval Completion
    • 31
    • PDF
    Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
    • 23
    • Highly Influenced
    • PDF
    Subexponential parameterized algorithm for interval completion
    • 10
    • PDF
    Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
    • 3
    • PDF
    Subexponential parameterized algorithms and kernelization on almost chordal graphs
    • 1
    • PDF

    References

    SHOWING 1-10 OF 76 REFERENCES
    A polynomial approximation algorithm for the minimum fill-in problem
    • 49
    • PDF
    Treewidth and Minimum Fill-in: Grouping the Minimal Separators
    • 182
    • Highly Influential
    • PDF
    Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping
    • 72
    • PDF
    Exact Algorithms for Treewidth and Minimum Fill-In
    • 82
    • PDF
    Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
    • 154
    • PDF
    Faster Parameterized Algorithms for Minimum Fill-in
    • 16
    • PDF
    On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs
    • 92
    • PDF
    Interval completion with few edges
    • 41
    • PDF
    Algorithmic Aspects of Vertex Elimination on Graphs
    • 1,167
    • PDF
    Finding Induced Subgraphs via Minimal Triangulations
    • 91
    • PDF