research
∙
03/28/2022
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams
Finding the connected components of a graph is a fundamental problem wit...
share
research
∙
02/16/2021
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
We present algorithms for the Max-Cover and Max-Unique-Cover problems in...
research
∙
02/13/2019
