Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal
Matching

v1v2v3 (latest)

Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching

17 July 2018

Soheil Behnezhad

Mahsa Derakhshan

Mohammadtaghi Hajiaghayi

ArXiv (abs)PDF HTML

Papers citing "Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching"

6 / 6 papers shown

Title
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond M. Ghaffari Christoph Grunau Ce Jin 57 30 0 22 Feb 2020
Near-Optimal Massively Parallel Graph Connectivity Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 67 52 0 11 Oct 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 92 62 0 11 Jan 2019
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 61 66 0 07 Nov 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 62 30 0 23 Jul 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 54 58 0 08 May 2018