P114: Enumeration of all cutsets in a graph

P114: Enumeration of all cutsets in a graph

Input:

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

Output:

All cutsets in $G$.

Complexity:

$O((|V| + |E|)(\mu + 1))$ total time and $O(|V| + |E|)$ or $O(|V|^2)$ space.

Comment:

$\mu$ is the number of solutions.

Reference:

[Tsukiyama1980] (Bibtex)