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

05/02/2019
by   Alexandr Andoni, et al.
0

Many modern parallel systems, such as MapReduce, Hadoop and Spark, can be modeled well by the MPC model. The MPC model captures well coarse-grained computation on large data --- data is distributed to processors, each of which has a sublinear (in the input data) amount of memory and we alternate between rounds of computation and rounds of communication, where each machine can communicate an amount of data as large as the size of its memory. This model is stronger than the classical PRAM model, and it is an intriguing question to design algorithms whose running time is smaller than in the PRAM model. In this paper, we study two fundamental problems, 2-edge connectivity and 2-vertex connectivity (biconnectivity). PRAM algorithms which run in O( n) time have been known for many years. We give algorithms using roughly log diameter rounds in the MPC model. Our main results are, for an n-vertex, m-edge graph of diameter D and bi-diameter D', 1) a O( D_m/n n) parallel time 2-edge connectivity algorithm, 2) a O( D^2_m/nn+ D'_m/nn) parallel time biconnectivity algorithm, where the bi-diameter D' is the largest cycle length over all the vertex pairs in the same biconnected component. Our results are fully scalable, meaning that the memory per processor can be O(n^δ) for arbitrary constant δ>0, and the total memory used is linear in the problem size. Our 2-edge connectivity algorithm achieves the same parallel time as the connectivity algorithm of Andoni et al. (FOCS 2018). We also show an Ω( D') conditional lower bound for the biconnectivity problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2019

Near-Optimal Massively Parallel Graph Connectivity

Identifying the connected components of a graph, apart from being a fund...
research
05/08/2018

Parallel Graph Connectivity in Log Diameter Rounds

We study graph connectivity problem in MPC model. On an undirected graph...
research
08/08/2019

Small Cuts and Connectivity Certificates: A Fault Tolerant Approach

We revisit classical connectivity problems in the CONGEST model of distr...
research
03/02/2020

Connected Components on a PRAM in Log Diameter Time

We present an O(log d + loglog_m/n n)-time randomized PRAM algorithm for...
research
06/22/2019

2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network

Self-stabilization for non-masking fault-tolerant distributed system has...
research
08/20/2018

Graph connectivity in log-diameter steps using label propagation

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

Massively Parallel Algorithms for the Stochastic Block Model

Learning the community structure of a large-scale graph is a fundamental...

Please sign up or login with your details

Forgot password? Click here to reset