P187: Enumeration of all $(s, t)$-cuts in an weighted undirected graph

P187: Enumeration of all $(s, t)$-cuts in an weighted undirected graph

Input:

An weighted undirected graph $G = (V, E)$.

Output:

All cuts in $G$ by non-decreasing weights ordering.

Complexity:

$O(|V||E|\log(|V|^2/|E|))$ delay.

Comment:

Reference:

[Yeh2010] (Bibtex)