P371: Enumeration of $K$-best cuts in a network

P371: Enumeration of $K$-best cuts in a network

Input:

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

Output:

$K$-best cuts in $G$.

Complexity:

$O(K\cdot |V|^4)$ time.

Comment:

Reference:

[Hamacher1984a] (Bibtex)