Parallel Batch-Dynamic Graphs - Algorithms and Lower Bounds

Laxman Dhulipala
Laxman Dhulipala
David Durfee
David Durfee
Janardhan Kulkarni
Janardhan Kulkarni
Saurabh Sawlani
Saurabh Sawlani

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020, pp. 1300-1319, 2020.

被引用5|引用|浏览19|来源
EI

摘要

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ε for some consta...更多

代码

数据

您的评分 :
0

 

标签
评论