We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G = (V, E) and an integer k, decide whether there exists F ⊆ V , |F | ≤ k, such that G[V \ F ] is a forest and G[F ] is connected. We show that Connected ...
