Old Web
English
Sign In
Acemap
>
Paper
>
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.
2021
Jianer Chen
Qin Huang
Iyad A. Kanj
Qian Li
Ge Xia
Keywords:
Algorithm
Computer science
Graph (abstract data type)
Matching (graph theory)
Streaming algorithm
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]