Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
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
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Zohar Feldman, Avishai Mandelbaum
WSC 2010