P94: Enumeration of all minimum weighted $(s, t)$ cuts in an weighted graph

P94: Enumeration of all minimum weighted $(s, t)$ cuts in an weighted graph

Input:

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

Output:

All minimum weighted $(s, t)$ cuts in $G$.

Complexity:

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

Comment:

Reference:

[Provan1996] (Bibtex)