György E. Révész
Theoretical Computer Science
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
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking