Robert E. Donovan
INTERSPEECH - Eurospeech 2001
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
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Nanda Kambhatla
ACL 2004
Rolf Clauberg
IBM J. Res. Dev