Parallel Graph Connectivity in Log Diameter Rounds

05/08/2018
by   Alexandr Andoni, et al.
0

We study graph connectivity problem in MPC model. On an undirected graph with n nodes and m edges, O( n) round connectivity algorithms have been known for over 35 years. However, no algorithms with better complexity bounds were known. In this work, we give fully scalable, faster algorithms for the connectivity problem, by parameterizing the time complexity as a function of the diameter of the graph. Our main result is a O( D _m/n n) time connectivity algorithm for diameter-D graphs, using Θ(m) total memory. If our algorithm can use more memory, it can terminate in fewer rounds, and there is no lower bound on the memory per processor. We extend our results to related graph problems such as spanning forest, finding a DFS sequence, exact/approximate minimum spanning forest, and bottleneck spanning forest. We also show that achieving similar bounds for reachability in directed graphs would imply faster boolean matrix multiplication algorithms. We introduce several new algorithmic ideas. We describe a general technique called double exponential speed problem size reduction which roughly means that if we can use total memory N to reduce a problem from size n to n/k, for k=(N/n)^Θ(1) in one phase, then we can solve the problem in O(_N/n n) phases. In order to achieve this fast reduction for graph connectivity, we use a multistep algorithm. One key step is a carefully constructed truncated broadcasting scheme where each node broadcasts neighbor sets to its neighbors in a way that limits the size of the resulting neighbor sets. Another key step is random leader contraction, where we choose a smaller set of leaders than many previous works do.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2019

Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity

Many modern parallel systems, such as MapReduce, Hadoop and Spark, can b...
research
05/08/2018

Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

A fundamental question that shrouds the emergence of massively parallel ...
research
08/20/2018

Graph connectivity in log-diameter steps using label propagation

The fastest deterministic algorithms for connected components take logar...
research
07/14/2023

On Diameter Approximation in Directed Graphs

Computing the diameter of a graph, i.e. the largest distance, is a funda...
research
01/16/2023

Computing Distance-based metrics on Very Large Graphs

We propose PROPAGATE, a fast approximation framework to estimate distanc...
research
11/07/2022

Optimal Deterministic Massively Parallel Connectivity on Forests

We show fast deterministic algorithms for fundamental problems on forest...
research
09/22/2020

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition

Given a graph G=(V,E) with arboricity α, we study the problem of decompo...

Please sign up or login with your details

Forgot password? Click here to reset