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

by J Hao, J B Orlin
Venue:Proceedings of the Third Annual ACM-SIAM-Symposium on Discrete Algorithms