Parallel graph algorithms in constant adaptive rounds: theory meets practice

Parallel graph algorithms in constant adaptive rounds: theory meets practice

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 focus on the Adaptive Massively Parallel Computation (AMPC) model, which is a theoretical model that captures MapReduce...

Full description

Bibliographic Details
Main Authors: Behnezhad, Soheil, Dhulipala, Laxman, Esfandiari, Hossein, Lacki, Jakub, Mirrokni, Vahab, Schudy, Warren
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Published: VLDB Endowment 2021
Online Access:https://hdl.handle.net/1721.1/136701

Internet

https://hdl.handle.net/1721.1/136701

Similar Items