Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model

Published in FSTTCS, 2024

Recommended citation: Christian Konrad, Andrew McGregor, Rik Sengupta and Cuong Than. (2024). "Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. " The Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). https://drops.dagstuhl.de/storage/00lipics/lipics-vol323-fsttcs2024/LIPIcs.FSTTCS.2024/LIPIcs.FSTTCS.2024.pdf#page=579

Download paper here