Work

Parallel Batch-Dynamic Graph Connectivity

Year: 2019
Type: conference-paper
Abstract: In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. The best sequential algorithm for dynamic connectivity is the elegant level-set algorithm of Holm, de Lichtenberg and Thorup (HDT), which achieves O(łog2 n) amortized time per edge insertion or deletion, and O(łog n) time per query.
Language: English
Open Access status: bronze
OpenAlex ID: W2923254968
FWCI: 5.263
Cites: 81
Cited by: 68
Related to: 9