William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 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
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking