On the connectivity preserving minimum cut problem.

Qi Duan Jinhui Xu

Published in: J. Comput. Syst. Sci. (2014)

Keyphrases

minimum cut
maximum flow
graph cuts
weighted graph
graph partitioning
shortest path
shortest path problem
min cut max flow
min cut
push relabel
connected components
markov random field
shape prior
image processing
energy minimization
directed graph
linear program
image segmentation