Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
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
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Leo Liberti, James Ostrowski
Journal of Global Optimization