S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
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
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990