David A. Selby
IBM J. Res. Dev
Paper
On the number of small cuts in a graph
Abstract
We prove that in an undirected graph there are at most O(n2) cuts of size strictly less than 3/2 of the size of the minimum cut.
Related
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Thomas M. Cover
IEEE Trans. Inf. Theory
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004