Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
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
Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Conference paper
Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking