A faster algorithms for finding the minimum cut in a graph, in (1992)

by J Hao, J B Orlin
Venue:Proc. 3rd Annual Symposium on Discrete Algorithms (SODA ’92