Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.

Liang Zhao Hiroshi Nagamochi Toshihide Ibaraki

Published in: ISAAC (1999)

Keyphrases

minimum cut
spanning tree
connected components
maximum flow
edge disjoint
real time
shortest path
global minimum
graph construction
min cut