Rizzi, Romeo (2002) A Simple Minimum T-Cut Algorithm. UNSPECIFIED.
We give a simple algorithm for finding a minimum T-cut. At present, all known efficient algorithms for this problem go through the computation of a Gomory-Hu tree. While our algorithm bases on the same fundamental properties of uncrossing as the previous methods, still it provides an ad-hoc solution. This solution is easier to implement and faster to run. Our results extend to the whole of symmetric submodular functions.
Actions (login required)