Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
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
Yao Qi, Raja Das, et al.
ISSTA 2009
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Leo Liberti, James Ostrowski
Journal of Global Optimization