24
Minimal Cuts
• Let G = (V,E) be a
graph. Each edge
(u,v) has a weight w(u,v)
that
represents the similarity between u and v.
• Graph G can be broken into 2 disjoint graphs
with node sets
A and
B by removing edges that connect these sets.
• Let cut(A,B) = å
w(u,v).
• One way to segment G is to find the minimal
cut.
ueA, veB