 |
 |
18 of 18 |  |
 |
 |
MIT
Conclusion
l
Algorithm for all cuts is “finished”
»
basically optimal time bound
»
extremely simple
»
a contender in practice
»
parallelizable
l
Linear time algorithm needs more work:
»
eliminate several logarithmic factors
»
don’t use dynamic trees