Zohar Feldman, Avishai Mandelbaum
WSC 2010
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
David A. Selby
IBM J. Res. Dev
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010