Abstract

The FEEDBACK VERTEX SET problem on unweighted, undirected graphs is considered. Improving upon a result by Burrage et al. [7], we show that this problem has a kernel with O(κ3) vertices, i.e., there is a polynomial time algorithm, that given a graph G and an integer κ, finds a graph
... read more