Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
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
Association control in mobile wireless networks
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Fan Zhang, Junwei Cao, et al.
IEEE TETC
M.F. Cowlishaw
IBM Systems Journal