Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
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
Elliot Linzer, M. Vetterli
Computing
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design