Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.

Jianer Chen Qin Huang Iyad Kanj Qian Li Ge Xia

Published in: ISAAC (2021)

Keyphrases

optimal or near optimal
computational complexity
matching algorithm
data structure
monte carlo
brute force