Fetching the paper…
Reading the bibliography…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale parallel computation frameworks and has recently gained a lot of importance, especially in the context of classic graph problems.
Edge-Disjoint Spanning Trees of Finite Graphs
Crispin St. J. Nash-Williams · 1961
Earlier work this paper cites.
Decomposition of Finite Graphs into Forests
Crispin St. J. Nash-Williams · 1964
Earlier work this paper cites.
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Michael Luby · 1985
Earlier work this paper cites.
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
Noga Alon, László Babai, and Alon Itai · 1986
Earlier work this paper cites.
Locality in Distributed Graph Algorithms
Nathan Linial · 1992
Earlier work this paper cites.
Equitable Coloring Extends Chernoff-Hoeffding Bounds
Sriram V. Pemmaraju · 2001
Earlier work this paper cites.
Finding Graph Matchings in Data Streams
Andrew McGregor · 2005
Earlier work this paper cites.
Bounded Arboricity to Determine the Local Structure of Sparse Graphs
Gaurav Goel and Jens Gustedt · 2006
Earlier work this paper cites.
Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks
Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly · 2007
Earlier work this paper cites.
MapReduce: Simplified Data Processing on Large Clusters
Jeffrey Dean and Sanjay Ghemawat · 2008
Earlier work this paper cites.
Distributed Approximate Matching
Zvi Lotker, Boaz Patt-Shamir, and Adi Rosén · 2009
Earlier work this paper cites.
Sublogarithmic Distributed MIS Algorithm for Sparse Graphs Using Nash-Williams Decomposition
Leonid Barenboim and Michael Elkin · 2010
Cited alongside, same era.
A Model of Computation for MapReduce
Howard Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010
Cited alongside, same era.
Brief Announcement: Exponential Speed-Up of Local Algorithms Using Non-Local Communication
Christoph Lenzen and Roger Wattenhofer · 2010
Cited alongside, same era.
Spark: Cluster Computing with Working Sets
Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica · 2010
Cited alongside, same era.
Sorting, Searching, and Simulation in the MapReduce Framework
Michael T. Goodrich, Nodari Sitchinava, and Qin Zhang · 2011
Cited alongside, same era.
Filtering: a Method for Solving Graph Problems in MapReduce
Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, and Sergei Vassilvitskii · 2011
An Improved Distributed Algorithm for Maximal Independent Set
Mohsen Ghaffari · 2016
Later among the works it cites.
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab Mirrokni, and Cliff Stein · 2017
Later among the works it cites.
Randomized Composable Coresets for Matching and Vertex Cover
Sepehr Assadi and Sanjeev Khanna · 2017
Later among the works it cites.
Communication Steps for Parallel Query Processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2017
Later among the works it cites.
Parallel Graph Connectivity in Log Diameter Rounds
Alexandr Andoni, Clifford Stein, Zhao Song, Zhengyu Wang, and Peilin Zhong · 2018
Closest in time.
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The Locality of Distributed Symmetry Breaking
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider · 2012
Cited alongside, same era.
Hadoop: The Definitive Guide
Tom White · 2012
Cited alongside, same era.
Toward More Localized Local Algorithms: Removing Assumptions Concerning Global Knowledge
Amos Korman, Jean-Sébastien Sereni, and Laurent Viennot · 2013
Cited alongside, same era.
Parallel algorithms for geometric graph problems
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev · 2014
Cited alongside, same era.
Skew in Parallel Query Processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2014
Cited alongside, same era.
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, and Richard M. Karp · 2018
Closest in time.
Sebastian Brandt, Manuela Fischer, and Jara Uitto · 2018
Closest in time.
Round Compression for Parallel Matching Algorithms
Artur Czumaj, Jakub Łącki, Aleksander Mądry, Slobodan Mitrović, Krzysztof Onak, and Piotr Sankowski · 2018
Closest in time.
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrović, and Ronitt Rubinfeld · 2018
Closest in time.
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
Mohsen Ghaffari and Jara Uitto · 2018
Closest in time.
Fully Dynamic MIS in Uniformly Sparse Graphs
Krzysztof Onak, Baruch Schieber, Shay Solomon, and Nicole Wein · 2018
Closest in time.