Randomized greedy algorithms for the maximum matching problem with new analysis

DOI10.1109/FOCS.2012.20MaRDI QIDQ6988172zbMATH OpenFDO

Authors Mario Szegedy, Matthias Poloczek

Publication date 5 May 2025

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

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

• Toward a better understanding of randomized greedy matching

This page was built for publication: Randomized greedy algorithms for the maximum matching problem with new analysis

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