MIT
4
Cuts in Graphs
lFocus on undirected graphs
lA cut is a vertex partition
lValue is number (or total weight) of crossing edges