On the number of small cuts in a graph

Paper

08 Jul 1996

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.

Paper

Charles H. Bennett, Aram W. Harrow, et al.

IEEE Trans. Inf. Theory

Paper

Heinz Koeppl, Marc Hafner, et al.

BMC Bioinformatics

Paper

Sonia Cafieri, Jon Lee, et al.

Journal of Global Optimization

Conference paper

Corneliu Constantinescu

SPIE Optical Engineering + Applications 2009