Parallel Batch-Dynamic k-Clique Counting

03/30/2020
by   Laxman Dhulipala, et al.
0

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^(2k - 1)ω_p/3(ω_p + 1), (Δ+m)^2(k + 1)ω_p/3(ω_p + 1))) amortized work, O(log (Δ+m)) depth, and O((Δ+m)^2(k + 1)ω_p/3(ω_p + 1)) space.

READ FULL TEXT

page 10

page 11

page 14

page 19

page 20

page 21

research
09/27/2021

Improved algorithms for Boolean matrix multiplication via opportunistic matrix multiplication

Karppa Kaski (2019) proposed a novel type of "broken" or "opportunis...
research
05/10/2022

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

Hierarchical agglomerative clustering (HAC) is a popular algorithm for c...
research
06/14/2018

Bounds and algorithms for k-truss

A k-truss is a relaxation of a k-clique developed by Cohen (2005), speci...
research
02/17/2022

Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs

Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in ma...
research
03/21/2019

Parallel Batch-Dynamic Graph Connectivity

With the rapid growth of graph datasets over the past decade, a new kind...
research
04/16/2020

Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication

Consider an undirected weighted graph G = (V,E,w). We study the problem ...
research
06/06/2023

Generalized Pseudospectral Shattering and Inverse-Free Matrix Pencil Diagonalization

We present a randomized, inverse-free algorithm for producing an approxi...

Please sign up or login with your details

Forgot password? Click here to reset