P22: Enumeration of all minimal feedback vertex sets in a graph

P22: Enumeration of all minimal feedback vertex sets in a graph

Input:

A graph $G=(V,E)$.

Output:

All minimal feedback vertex sets in $G$.

Complexity:

$O(|V||E|(|V|+|E|))$ time delay.

Comment:

Theorem 2

Reference:

[Schwikowski2002] (Bibtex)