Sign in

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

Jianer ChenQin HuangIyad KanjQian LiGe Xia
Published in: ISAAC (2021)
Keyphrases
  • optimal or near optimal
  • computational complexity
  • matching algorithm
  • data structure
  • monte carlo
  • brute force