In undirected graphs with real non-negative weights, we give a new rando...
A k-vertex connectivity oracle for undirected G is a data structure that...
In this paper we continue a long line of work on representing the cut
st...
We study sketching schemes for the cardinality estimation problem in dat...