Parallel Batch-Dynamic $k$-Clique Counting

Abstract

In this paper, we study new batch-dynamic algorithms for k-clique counting, which are dynamic algorithms where the updates are batches of edge insertions and deletions. We study this problem in the parallel setting, where the goal is to obtain algorithms with low (poly-logarithmic) depth. Our first result is a new parallel batch-dynamic triangle counting algorithm with O(∆ √ ∆ + m) amortized work and O(log * (∆ + m)) depth with high probability (w.h.p.), and O(∆ + m) space for a batch of ∆ edge insertions or deletions. Our second result is a simple parallel batch-dynamic k-clique counting algorithm that uses a newly developed parallel k-clique counting algorithm to bootstrap itself, by enumerating smaller cliques, and intersecting them with the batch. Instantiating this idea gives a simple batch-dynamic algorithm running in O(∆(m + ∆)α k−4 ) expected work and O(log k−2 n) depth w.h.p., all in O(m + ∆) space. Our third result is an algebraic algorithm based on parallel fast matrix multiplication. Assuming that a parallel fast matrix multiplication algorithm exists with parallel matrix multiplication constant ω p , the same algorithm solves dynamic k-clique counting with O min ∆m

Fully Dynamic Four-Vertex Subgraph Counting

“…Kara et al [12] provided an algorithm for counting triangles in amortized time O( √ m) per update and enumerating them with constant time delay. Dhulipala et al [7] extended it to a batch-dynamic parallel algorithm with O(∆ √ ∆ + m) amortized work and O(polylog(∆ + m)) depth w.h.p. for a batch of ∆ updates.…”