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

Ehud Altman, Kenneth R. Brown, et al.

PRX Quantum

Conference paper

Corneliu Constantinescu

SPIE Optical Engineering + Applications 2009

Conference paper

Bowen Zhou, Bing Xiang, et al.

SSST 2008

Conference paper

Michael C. McCord, Violetta Cavalli-Sforza

ACL 2007