1 citations · 1 across the 1 of their papers we have counts for
1 paper
Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi +1
Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a vertex set T of size at most k that hits all cycles in the graph. The fixed-param…