Near-Optimal Massively Parallel Graph Connectivity

@article{Behnezhad2019NearOptimalMP,
  title={Near-Optimal Massively Parallel Graph Connectivity},
  author={Soheil Behnezhad and L. Dhulipala and Hossein Esfandiari and J. Lacki and V. Mirrokni},
  journal={2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2019},
  pages={1615-1636}
}
  • Soheil Behnezhad, L. Dhulipala, +2 authors V. Mirrokni
  • Published 2019
  • Mathematics, Computer Science
  • 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
  • Identifying the connected components of a graph, apart from being a fundamental problem with countless applications, is a key primitive for many other algorithms. In this paper, we consider this problem in parallel settings. Particularly, we focus on the Massively Parallel Computations (MPC) model, which is the standard theoretical model for modern parallel frameworks such as MapReduce, Hadoop, or Spark. We consider the truly sublinear regime of MPC for graph problems where the space per… CONTINUE READING
    18 Citations

    Figures from this paper

    Parallel graph algorithms in constant adaptive rounds
    • 1
    • Highly Influenced
    Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
    • 1
    • PDF
    Parallel Algorithms for Small Subgraph Counting
    • 1
    • PDF
    Equivalence Classes and Conditional Hardness in Massively Parallel Computations
    • 4
    • Highly Influenced
    • PDF
    Connected Components on a PRAM in Log Diameter Time
    • 2
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 87 REFERENCES
    Parallel Graph Connectivity in Log Diameter Rounds
    • 49
    • Highly Influential
    • PDF
    Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
    • 38
    • Highly Influential
    • PDF
    Connected Components at Scale via Local Contractions
    • 12
    • PDF
    Massively Parallel Computation of Matching and MIS in Sparse Graphs
    • 19
    Parallel algorithms for geometric graph problems
    • 116
    • PDF
    Brief Announcement: MapReduce Algorithms for Massive Trees
    • 3
    • PDF
    Round compression for parallel matching algorithms
    • 61
    • PDF
    Finding connected components in map-reduce in logarithmic rounds
    • 109
    • PDF
    Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)
    • 32
    • Highly Influential
    • PDF