P436: Enumeration of all minimal cuts in a graph

P436: Enumeration of all minimal cuts in a graph

Input:

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

Output:

All minimal cuts in $G$.

Complexity:

$O(N)$ total time and $O(|V|^2)$ space.

Comment:

Reference:

[HeejongSuh2000] (Bibtex)