Dynamic algorithms for maximum matching size

DOI10.1137/1.9781611977554.CH6MaRDI QIDQ6538531zbMATH OpenFDO

Authors Soheil Behnezhad

Publication date 14 May 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Decremental matching in general weighted graphs
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• Sketching approximability of all finite CSPs
• A 0.51-approximation of maximum matching in sublinear \(n^{1.5}\) time

This page was built for publication: Dynamic algorithms for maximum matching size

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