Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms

@article{Fomin2012PlanarFA,
  title={Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms},
  author={Fedor V. Fomin and Daniel Lokshtanov and Neeldhara Misra and Saket Saurabh},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={470-479}
}
Let F be a finite set of graphs. In the F-DELETION problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that the resulting graph does not contain a graph from F as a minor. F-DELETION is a generic problem and by selecting different sets of forbidden minors F, one can obtain various fundamental problems such as VERTEX COVER, FEEDBACK VERTEX SET or TREEWIDTH η-DELETION. In this paper we obtain a number of generic… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 57 extracted citations

Similar Papers

Loading similar papers…