Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set

Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini +2

We consider the feedback vertex set problem in undirected graphs (FVS). The input to FVS is an undirected graph $G=(V,E)$ with non-negative vertex costs. The goal is to find a mini…