Exponentially faster massively parallel maximal matching

DOI10.1109/FOCS.2019.00096MaRDI QIDQ6944138zbMATH OpenFDO

Authors Soheil Behnezhad, David G. Harris, Mohammad T. Hajiaghayi

Publication date 12 August 2025

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

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(7)

• Sample-and-gather: fast ruling set algorithms in the low-memory MPC model
• Dynamic maximal matching in clique networks
• Massively parallel computation in a heterogeneous regime
• Rounds vs. communication tradeoffs for maximal independent sets
• Massively parallel algorithms for approximate shortest paths
• Streaming graph algorithms in the massively parallel computation model
• Parallel derandomization for coloring

This page was built for publication: Exponentially faster massively parallel maximal matching

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