Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

8 May 2018

Papers citing "Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs"

26 / 26 papers shown

Title
Fast Dynamic Programming in Trees in the MPC Model Chetan Gupta R. Latypov Yannic Maus Shreyas Pai Simo Särkkä Jan Studený Jukka Suomela Jara Uitto Hossein Vahidi 63 4 0 05 May 2023
Improved Deterministic Connectivity in Massively Parallel Computation Manuela Fischer Jeff Giliberti Christoph Grunau 72 5 0 03 Jun 2022
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 61 21 0 10 Dec 2021
Efficient and Local Parallel Random Walks Michael Kapralov Silvio Lattanzi Navid Nouri Jakab Tardos 31 2 0 01 Dec 2021
Adaptive Massively Parallel Constant-round Tree Contraction Mohammadtaghi Hajiaghayi Marina Knittel Hamed Saleh Hsin-Hao Su 33 3 0 02 Nov 2021
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 81 18 0 09 Aug 2021
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 84 8 0 26 Sep 2020
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 74 21 0 08 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
Connected Components on a PRAM in Log Diameter Time S. Liu R. Tarjan Peilin Zhong 56 9 0 02 Mar 2020
Massively Parallel Algorithms for Small Subgraph Counting Amartya Shankha Biswas T. Eden Quanquan C. Liu Slobodan Mitrović R. Rubinfeld 81 8 0 19 Feb 2020
How fast can you update your MST? (Dynamic algorithms for cluster computing) Seth Gilbert L. Li 58 4 0 17 Feb 2020
Parallel Batch-dynamic Trees via Change Propagation Umut A. Acar Daniel Anderson G. Blelloch Laxman Dhulipala Sam Westrick 24 2 0 12 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel Computations Danupon Nanongkai Michele Scquizzato 68 18 0 07 Jan 2020
New lower bounds for Massively Parallel Computation from query complexity Moses Charikar Weiyun Ma Li-Yang Tan 39 1 0 05 Jan 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 85 29 0 11 Dec 2019
Near-Optimal Massively Parallel Graph Connectivity Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 83 52 0 11 Oct 2019
Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions M. Ghaffari Krzysztof Nowicki M. Thorup 162 50 0 02 Sep 2019
Massively Parallel Computation via Remote Memory Access Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki W. Schudy Vahab Mirrokni 76 28 0 18 May 2019
Log Diameter Rounds Algorithms for $2$ -Vertex and $2$ -Edge Connectivity Alexandr Andoni C. Stein Peilin Zhong 48 19 0 02 May 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 99 62 0 11 Jan 2019
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 67 66 0 07 Nov 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 76 30 0 23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 61 18 0 17 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
Parallel Graph Connectivity in Log Diameter Rounds Alexandr Andoni C. Stein Zhao Song Zhengyu Wang Peilin Zhong 80 99 0 08 May 2018