A single-exponential FPT algorithm for the K4 K 4 -minor cover problem ?
We provide an efficient FPT algorithm for the K4 K 4 -minor cover problem. It combines iterative compression with protrusion reduction and branching. It extends previous algorithms for Vertex Cover and Feedback Vertex Set.
treewidth-2 deletion treewidth deletion fixed-parameter tractable algorithms k4 k 4 -minor cover k4 k 4 k4 k 4 k 4 minor cover