  The feedback vertex set problem is one of the most studied parameterized
problems. Several generalizations of the problem have been studied where one is
to delete vertices to obtain graphs close to acyclic. In this paper, we give an
FPT algorithm for the problem of deleting at most $k$ vertices to get an
$r$-pseudoforest. A graph is an $r$-pseudoforest if we can delete at most $r$
edges from each component to get a forest. Philip et al. introduced this
problem and gave an $O^*(c_{r}^{k})$ algorithm for it, where $c_r$ depends on
$r$ double exponentially. In comparison, our algorithm runs in time
$O^*((10k)^{k})$, independent of $r$.
