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]
@inproceedings{ChenHK0X21,
title = {Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time},
author = {Jianer Chen and Qin Huang and Iyad Kanj and Qian Li 0012 and Ge Xia},
year = {2021},
doi = {10.4230/LIPIcs.ISAAC.2021.48},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.48},
researchr = {https://researchr.org/publication/ChenHK0X21},
cites = {0},
citedby = {0},
booktitle = {32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan},
editor = {Hee-Kap Ahn and Kunihiko Sadakane},
volume = {212},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-214-3},
}