 |
 |
15 of 32 |  |
 |
 |
MIT
Implementation
l
Repeat to amplify success probability
l
Share work among repetitions
l
Result: find min-cut w.h.p in O(n² log³
n)
time.
l
Monte Carlo (no certification of answer)
MIT
Implementation
l
Repeat to amplify success probability
l
Share work among repetitions
l
Result: find min-cut w.h.p in O(n² log³
n)
time.
l
Monte Carlo (no certification of answer)
|