Here are some interesting links related to our work:

• Experimental Study of Minimum Cut Algorithms
  This link contains the code, which our code is implemented upon. We are using the 'ho' implementation for the max-flow problem as a "black box" in order to implement the algorithms for the cut-tree problem.

Last Updated: Fri Nov 19 14:58:27 EST 1999
Back to the main page.