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

Liang Zhao Hiroshi Nagamochi Toshihide Ibaraki

Published in: J. Comb. Optim. (2001)

Keyphrases

minimum cut
maximum flow
spanning tree
random walk
square error
image segmentation
graph representation
bayesian networks
directed graph
graph structure