A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For n-vertex and medge graphs, the best known algorithms run in O(m √ n) time. We build on recent theoretical work focusing on linear-time data reduction rules for finding maximum-cardinality matchings and complement the theoretical results by presenting and analyzing (thereby employing the kernelization methodology of parameterizeddoi:10.4230/lipics.esa.2018.53 dblp:conf/esa/KorenweinNNZ18 fatcat:3oouhvueibbgtplx24rmqdgvw4