New trade-offs for fully dynamic matching via hierarchical EDCS

DOI10.1137/1.9781611977073.140MaRDI QIDQ6575221zbMATH OpenFDO

Authors Soheil Behnezhad, Sanjeev Khanna

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.140

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Decremental matching in general weighted graphs
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• One-way communication complexity of minimum vertex cover in general graphs

This page was built for publication: New trade-offs for fully dynamic matching via hierarchical EDCS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575221)