Fully dynamic maximal matching in constant update time

DOI10.1109/FOCS.2016.43MaRDI QIDQ6946466zbMATH OpenFDO

Authors Shay Solomon

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.43

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(5)

• Fully dynamic sequential and distributed algorithms for MAX-CUT
• On the complexity of algorithms with predictions for dynamic graph problems
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• A generalized matching reconfiguration problem
• Dynamic algorithms for submodular matching

This page was built for publication: Fully dynamic maximal matching in constant update time

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