Cuts in Graphs
l
Focus on undirected graphs
l
A
cut
is a vertex partition
l
Value is number (or total weight) of
crossing edges
