2 papers
cs.DS2023
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Jianer Chen, Qin Huang, Iyad Kanj +2
We present streaming algorithms for the graph -matching problem in both the insert-only and dynamic models. Our algorithms, with space complexity matching the best upper bounds,…
cs.DS2014
How to select the largest k elements from evolving data?
Qin Huang, Xingwu Liu, Xiaoming Sun +1
In this paper we investigate the top--selection problem, i.e. determine the largest, second largest, ..., and the -th largest elements, in the dynamic data model. In this mod…