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

Jianer Chen, Qin Huang, Iyad Kanj, Qian Li 0012, Ge Xia. Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. In Hee-Kap Ahn, Kunihiko Sadakane, editors, 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan. Volume 212 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Abstract

Abstract is missing.