H Nagamochi, K Nishimura, T Ibaraki - SIAM Journal on Discrete Mathematics, 1997 - SIAM
Let λ(\calN) denote the weight of a minimum cut in an edge-weighted undirected network
\calN, and n and m denote the numbers of vertices and edges, respectively. It is known that …