Fetching the paper…
Reading the bibliography…
As a fundamental tool in hierarchical graph clustering, computing connected components has been a central problem in large-scale data mining.
Random graphs
Edgar N Gilbert · 1959
Earlier work this paper cites.
An O ( log n ) (\log{n}) parallel connectivity algorithm
Y. Shiloach and U. Vishkin · 1982
Earlier work this paper cites.
A bridging model for parallel computation
Leslie G. Valiant · 1990
Earlier work this paper cites.
Connected components on distributed memory machines
Arvind Krishnamurthy, Steven S. Lumetta, David E. Culler, and Katherine Yelick · 1994
Earlier work this paper cites.
Fast connected components algorithms for the erew pram
David R. Karger, Noam Nisan, and Michal Parnas · 1999
Earlier work this paper cites.
The diameter of sparse random graphs
Fan Chung and Linyuan Lu · 2001
Earlier work this paper cites.
The WebGraph framework I: Compression techniques
Paolo Boldi and Sebastiano Vigna · 2004
Earlier work this paper cites.
Bigtable: A distributed storage system for structured data
Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Michael Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber · 2008
Earlier work this paper cites.
A model of computation for mapreduce
Howard Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010
Earlier work this paper cites.
Pregel: a system for large-scale graph processing
Grzegorz Malewicz, Matthew H. Austern, Aart J.C Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski · 2010
Earlier work this paper cites.
Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks
Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna · 2011
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
Cited alongside, same era.
CC-MR - finding connected components in huge graphs with mapreduce
Thomas Seidl, Brigitte Boden, and Sergej Fries · 2012
Cited alongside, same era.
Finding connected components in map-reduce in logarithmic rounds
Laukik Chitnis, Anish Das Sarma, Ashwin Machanavajjhala, and Vibhor Rastogi · 2013
Cited alongside, same era.
Shuffles and circuits: (on lower bounds for modern parallel computation)
Tim Roughgarden, Sergei Vassilvitskii, and Joshua R. Wang · 2016
Later among the works it cites.
Simple round compression for parallel vertex cover
Sepehr Assadi · 2017
Later among the works it cites.
Affinity clustering: Hierarchical clustering at scale
Mohammadhossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, and Vahab Mirrokni · 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.
Round compression for parallel matching algorithms
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, and Piotr Sankowski · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev · 2014
Cited alongside, same era.
Connected components in mapreduce and beyond
Raimondas Kiveris, Silvio Lattanzi, Vahab Mirrokni, Vibhor Rastogi, and Sergei Vassilvitskii · 2014
Cited alongside, same era.
SNAP Datasets: Stanford large network dataset collection
Jure Leskovec and Andrej Krevl · 2014
Cited alongside, same era.
Computing connected components with linear communication cost in pregel-like systems
Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, and Wenjie Zhang · 2016
Cited alongside, same era.
Apache giraph
Apache Foundation · 2016
Cited alongside, same era.
Fast connected components computation in large graphs by vertex pruning
Alessandro Lulli, Emanuele Carlini, Patrizio Dazzi, Claudio Lucchese, and Laura Ricci · 2017
Later among the works it cites.
Grigory Yaroslavtsev and Adithya Vadapalli · 2017
Later among the works it cites.
Manuela Fischer and Jara Uitto · 2018
Closest in time.
Improved massively parallel computation algorithms for mis, matching, and vertex cover
Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, and Ronitt Rubinfeld · 2018
Closest in time.
Shortcutting label propagation for distributed connected components
Stergios Stergiou, Dipen Rughwani, and Kostas Tsioutsiouliklis · 2018
Closest in time.