P437: Enumeration of all minimal cuts of a given pair in a graph

P437: Enumeration of all minimal cuts of a given pair in a graph

Input:

A graph $G = (V, E)$ and a vertex pair $(s, t)$.

Output:

All minimal cuts for $(s, t)$ in $G$.

Complexity:

$O(|V|^3 N)$ total time and $O(|V|^3)$ space, where $N$ is the number of soutions.

Comment:

Reference:

[Abel1982] (Bibtex)