P23: Enumeration of all minimal feedback vertex sets in a directed graph

P23: Enumeration of all minimal feedback vertex sets in a directed graph

Input:

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

Output:

All minimal feedback vertex sets in $G$.

Complexity:

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

Comment:

Theorem 1

Reference:

[Schwikowski2002] (Bibtex)