Abstract

Finding a minimum feedback vertex set, a set whose removal makes a graph acyclic, is an NP-complete problem. We study the behaviour of existing algorithms for this problem on bounded degree graphs. Using the notion of generalized degree, we show that the algorithm of Fomin et al. [2] runs in
... read more