P70: Enumeration of $k$ best cuts in a directed graph

P70: Enumeration of $k$ best cuts in a directed graph

Input:

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

Output:

$k$ best cuts in $G$.

Complexity:

$O(k|V|^4)$ total time.

Comment:

Reference:

[Hamacher1984a] (Bibtex)