Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
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
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Thomas M. Cover
IEEE Trans. Inf. Theory
B. Wagle
EJOR