10 citations · 16 across the 8 of their papers we have counts for
3 papers · 1 filter
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari +3
We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we…
Massively Parallel Computation via Remote Memory Access
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari +3
We introduce the Adaptive Massively Parallel Computation (AMPC) model, which is an extension of the Massively Parallel Computation (MPC) model. At a high level, the AMPC model stre…
Connected Components at Scale via Local Contractions
Jakub Łącki, Vahab Mirrokni, Michał Włodarczyk
As a fundamental tool in hierarchical graph clustering, computing connected components has been a central problem in large-scale data mining. While many known algorithms have been…