%0 Conference Paper %1 conf/isaac/ChenHK0X21 %A Chen, Jianer %A Huang, Qin %A Kanj, Iyad %A Li, Qian %A Xia, Ge %B ISAAC %D 2021 %E Ahn, Hee-Kap %E Sadakane, Kunihiko %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 48:1-48:17 %T Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. %U http://dblp.uni-trier.de/db/conf/isaac/isaac2021.html#ChenHK0X21 %V 212 %@ 978-3-95977-214-3

@inproceedings{conf/isaac/ChenHK0X21, added-at = {2021-11-30T00:00:00.000+0100}, author = {Chen, Jianer and Huang, Qin and Kanj, Iyad and Li, Qian and Xia, Ge}, biburl = {https://www.bibsonomy.org/bibtex/2046cbc4946c5785959889e5821babd59/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/2021}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, ee = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.48}, interhash = {38a1c2e2165f1aede4717e0b6a4cc577}, intrahash = {046cbc4946c5785959889e5821babd59}, isbn = {978-3-95977-214-3}, keywords = {dblp}, pages = {48:1-48:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T09:48:18.000+0200}, title = {Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2021.html#ChenHK0X21}, volume = 212, year = 2021 }