A simple minimum T-cut algorithm

Romeo Rizzi
2003 Discrete Applied Mathematics  
We give a simple algorithm for ÿnding a minimum T -cut. At present, all known e cient 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. ?
doi:10.1016/s0166-218x(03)00182-3 fatcat:iw6vus3spbe6jkrrf5sjc3uhwu