Exponentially Faster Massively Parallel Maximal Matching

16 Oct 2019 Behnezhad Soheil Hajiaghayi MohammadTaghi Harris David G.

The study of approximate matching in the Massively Parallel Computations (MPC) model has recently seen a burst of breakthroughs. Despite this progress, however, we still have a far more limited understanding of maximal matching which is one of the central problems of parallel and distributed computing... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING