Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
symposium on discrete algorithms, pp. 1300-1319, 2019.
In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In this setting, the graph is stored on a number of machines, each having space strongly sublinear with respect to the number of vertices, that is, $n^\epsilon$ for...More
PPT (Upload PPT)