Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Conference paper
Soft x-ray diffraction of striated muscle
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006