Parallel Batch-Dynamic Graph Connectivity

by   Umut A. Acar, et al.

With the rapid growth of graph datasets over the past decade, a new kind of dynamic algorithm, supporting the ability to ingest batches of updates and exploit parallelism is needed in order to efficiently process large streams of updates. In this paper, we study batch and parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in sequential setting. Perhaps the best known sequential algorithm is the elegant level-set algorithm of Holm, de Lichtenberg and Thorup (HDT), which achieves O(^2 n) amortized time per edge insertion or deletion, and O( n) time per query. In this paper, we design a parallel batch-dynamic connectivity algorithm that is work-efficient with respect to the HDT algorithm for small batch sizes, and is asymptotically faster when the average batch size is sufficiently large. Given a sequence of batched updates, where Δ is the average batch size of all deletions, our algorithm achieves O( n (1 + n / Δ)) expected amortized work per edge insertion and deletion and O(^3 n) depth w.h.p. Our algorithm answers a batch of k connectivity queries in O(k (1 + n/k)) expected work and O( n) depth w.h.p. To the best of our knowledge, our algorithm is the first parallel batch-dynamic algorithm for connectivity.


page 1

page 2

page 3

page 4


Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span

Dynamic trees are a well-studied and fundamental building block of dynam...

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

In this paper we study the problem of dynamically maintaining graph prop...

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering

Hierarchical agglomerative clustering (HAC) is a popular algorithm for c...

Batch-Parallel Euler Tour Trees

The dynamic trees problem is to maintain a forest undergoing edge insert...

BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale

Many real-world applications operate on dynamic graphs that undergo rapi...

Parallel Batch-Dynamic k-Clique Counting

In this paper, we study new batch-dynamic algorithms for k-clique counti...

A note on 'A fully parallel 3D thinning algorithm and its applications'

A 3D thinning algorithm erodes a 3D binary image layer by layer to extra...

Please sign up or login with your details

Forgot password? Click here to reset