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

17 July 2018

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

4 / 4 papers shown

Title
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond M. Ghaffari Christoph Grunau Ce Jin 21 28 0 22 Feb 2020
Near-Optimal Massively Parallel Graph Connectivity Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 27 52 0 11 Oct 2019
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 24 66 0 07 Nov 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 22 58 0 08 May 2018