Yao Qi, Raja Das, et al.
ISSTA 2009
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
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking