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.

Conference paper

Renu Tewari, Richard P. King, et al.

IS&T/SPIE Electronic Imaging 1996

Conference paper

Erich P. Stuntebeck, John S. Davis II, et al.

HotMobile 2008

Paper

David A. Selby

IBM J. Res. Dev

Conference paper

Hans Becker, Frank Schmidt, et al.

Photomask and Next-Generation Lithography Mask Technology 2004