A Subexponential Parameterized Algorithm for Proper Interval Completion

@article{Bliznets2014ASP,
  title={A Subexponential Parameterized Algorithm for Proper Interval Completion},
  author={Ivan Bliznets and F. Fomin and Marcin Pilipczuk and Michal Pilipczuk},
  journal={ArXiv},
  year={2014},
  volume={abs/1402.3472}
}
In the Proper Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge additions into a proper interval graph, i.e., a graph admitting an intersection model of equal-length intervals on a line. The study of Proper Interval Completion from the viewpoint of parameterized complexity has been initiated by Kaplan, Shamir and Tarjan [FOCS 1994; SIAM J. Comput. 1999], who showed an algorithm for the problem working in \(\mathcal{O}(16^k\cdot… Expand
Subexponential Parameterized Algorithm for Interval Completion
Subexponential parameterized algorithm for interval completion
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
Exploring Subexponential Parameterized Complexity of Completion Problems
Paths to Trees and Cacti
Polynomial Kernelization for Removing Induced Claws and Diamonds
Rank Reduction of Directed Graphs by Vertex and Edge Deletions
...
1
2
3
...

References

SHOWING 1-10 OF 36 REFERENCES
A Subexponential Parameterized Algorithm for Proper Interval Completion
Subexponential Parameterized Algorithm for Interval Completion
Polynomial kernels for Proper Interval Completion and related problems
Fast FAST
Interval Completion Is Fixed Parameter Tractable
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
Subexponential parameterized algorithm for minimum fill-in
Faster Parameterized Algorithms for Deletion to Split Graphs
...
1
2
3
4
...