A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
We study the matching problem in the incremental setting, where we are given a sequence of edge insertions and aim at maintaining a near-maximum cardinality matching of the graph with small update time. We present a deterministic algorithm that, for any constant \(\varepsilon>0\), maintains a \((1+\varepsilon)\)-approximate matching with constant amortized update time per insertion.doi:10.5281/zenodo.4586902 fatcat:fcgckh737nfypcoo3mh5u4rttm