P91: Enumeration of all $(s, t)$-cuts in a graph

P91: Enumeration of all $(s, t)$-cuts in a graph

Input:

A graph $G = (V, E)$ and two vertices $s, t$ in $G$.

Output:

All $(s, t)$-cuts in $G$.

Complexity:

$O(|E|)$ time per cut.

Comment:

Reference:

[Provan1996] (Bibtex)