P177: Enumeration of all feedback vertex sets in a strongly connected directed graph

P177: Enumeration of all feedback vertex sets in a strongly connected directed graph

Input:

A strongly connected directed graph $G = (V, E)$ and an integer $k$.

Output:

All feedback vertex sets of size $k$ in $G$.

Complexity:

$O(|V|^{k-1}|E|)$ total time and $O(|E|)$ space.

Comment:

Reference:

[Garey1978] (Bibtex)