David S. Kung
DAC 1998
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
Robert C. Durbeck
IEEE TACON
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007