@InProceedings{feldman_et_al:LIPIcs.APPROX/RANDOM.2022.33,
author = {Feldman, Moran and Szarf, Ariel},
title = {{Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {33:1--33:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.33},
URN = {urn:nbn:de:0030-drops-171559},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.33},
annote = {Keywords: Maximum matching, semi-streaming algorithms, multi-pass algorithms}
}