Rolf Clauberg
IBM J. Res. Dev
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
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Conference paper
COUNTERFACTUAL CONCEPT BOTTLENECK MODELS
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025