Matching algorithms in the sparse stochastic block model

DOI10.4230/LIPICS.AOFA.2024.16MaRDI QIDQ6865682zbMATH OpenFDO

Authors Byron Chin, Nathan S. Sheffield, Divya Shyamal

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.AOFA.2024.16

zbMATH Keywords

matching algorithmsonline matchingstochastic block model

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites work

• A proof of the block model threshold conjecture
• Differential equations for random processes and random graphs
• Galton–Watson games
• scientific article; zbMATH DE number 1139976 (Why is no real title available?)
• Karp-Sipser based kernels for bipartite graph matching
• Karp-Sipser on random graphs with a fixed degree sequence
• The power of multiple choices in online stochastic matching

This page was built for publication: Matching algorithms in the sparse stochastic block model

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