 |
 |
2 of 18 |  |
 |
 |
MIT
l
Undirected graph G
l
A cut partitions vertices in 2
groups:
l
Goal: minimize edges crossing cut
l
m edges, n vertices, min-cut c
The Problem
MIT
l
Undirected graph G
l
A cut partitions vertices in 2
groups:
l
Goal: minimize edges crossing cut
l
m edges, n vertices, min-cut c
The Problem
|