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

by J Hao, J B Orlin
Venue:In Proceedings of the third annual ACM-Siam Symposium on Discrete Algorithms