Abstract
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 ε > 0, maintains a (1 + ε)-approximate matching with constant amortized update time per insertion.
Cite
CITATION STYLE
Grandoni, F., Leonardi, S., Sankowski, P., Schwiegelshohn, C., & Solomon, S. (2019). (1 + ε)-approximate incremental matching in constant deterministic amortized time. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1886–1898). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975482.114
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
