Abstract
Given a graph G and a parameter k∈N, the parameterized K4-minor cover problem asks whether at most k vertices can be deleted to turn G into a K4-minor-free graph, or equivalently in a graph of treewidth at most 2. This problem is inspired by two well-studied parameterized vertex deletion problems, Vertex Cover and Feedback Vertex Set, which can also be expressed as Treewidth-tVertex Deletion problems: t=0 for Vertex Cover and t=1 for Feedback Vertex Set. While single-exponential FPT algorithms, i.e. running in 2O(k)⋅nO(1) time, are known for these two latter problems, it was open whether the K4-minor cover problem could be solved in single-exponential FPT time. This paper answers this question in the affirmative. Observe that it is known to be unlikely that Treewidth-tVertex Deletion can be solved in time 2o(k)⋅nO(1).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
