Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
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
Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Kento Tsubouchi, Yosuke Mitsuhashi, et al.
npj Quantum Information
Preeti Malakar, Thomas George, et al.
SC 2012