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

by �HO94� J Hao, J B Orlin
Venue:Ž 1994 ., 424�446. � � 1� � Ha96 J. Hastad, ˚ Clique is hard to approximate within n , in ‘‘Proceedings of the 37th IEEE Symposium on Foundations of Computer Science