2026-08-10T23:23:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12924 2024-03-06T10:51:05Z ddc:004 open_access

Dynamic Matching Algorithms in Practice Henzinger, Monika Khan, Shahbaz Paul, Richard Schulz, Christian Matching Dynamic Matching Blossom Algorithm In recent years, significant advances have been made in the design and analysis of fully dynamic maximal matching algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. In this paper, we attempt to bridge the gap between theory and practice that is currently observed for the fully dynamic maximal matching problem. We engineer several algorithms and empirically study those algorithms on an extensive set of dynamic instances. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Monika Henzinger and Shahbaz Khan and Richard Paul and Christian Schulz 2020 Is Part Of LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2020.58 urn:nbn:de:0030-drops-129243 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.58 eng https://creativecommons.org/licenses/by/3.0/legalcode