Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
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
Nanda Kambhatla
ACL 2004
Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Leo Liberti, James Ostrowski
Journal of Global Optimization