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

Xinyi Su, Guangyu He, et al.

Dianli Xitong Zidonghua/Automation of Electric Power Systems

Paper

Matthias Kaiserswerth

IEEE/ACM Transactions on Networking

Conference paper

Inbal Ronen, Elad Shahar, et al.

SIGIR 2009

Conference paper

John M. Boyer, Charles F. Wiecha

DocEng 2009