A deterministic fully dynamic maximal matching algorithm achieves n^{1/2+o(1)} amortized update time using a new subgraph system for verification and recursive refinement.
Improved bounds for fully dynamic matching via ordered ruzsa-szemer´ edi graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
A deterministic fully dynamic maximal matching algorithm achieves n^{1/2+o(1)} amortized update time using a new subgraph system for verification and recursive refinement.