Simple Round Compression for Parallel Vertex Cover

14 September 2017

Papers citing "Simple Round Compression for Parallel Vertex Cover"

9 / 9 papers shown

Title
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 80 8 0 26 Sep 2020
Massively Parallel Algorithms for Distance Approximation and Spanners Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 97 20 0 02 Mar 2020
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 99 62 0 11 Jan 2019
Connected Components at Scale via Local Contractions Jakub Lacki Vahab Mirrokni Michał Włodarczyk 71 18 0 27 Jul 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 68 30 0 23 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation M. Ghaffari Jara Uitto 64 103 0 17 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
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 98 132 0 22 Feb 2018
Round Compression for Parallel Matching Algorithms A. Czumaj Jakub Lacki Aleksander Madry Slobodan Mitrovic Krzysztof Onak Piotr Sankowski 85 101 0 11 Jul 2017