| Random Selection |
|
|
|
|
|
|
|
|
|
|
|
| l | When most
choices good, do one at |
|||||||||
| random |
||||||||||
| l | Recursive
contraction algorithm for |
|||||||||
| minimum cuts |
||||||||||
| » | Extremely simple
(also to implement) |
|||||||||
| » | Fast in theory
and in practice [CGKLS] |
|||||||||
