Massively parallel algorithms for fully dynamic all-pairs shortest paths

In this paper, we propose the first fully dynamic parallel allpairs shortest path algorithm in the MPC model with a worstcase update rounds of \(O({n^{{2 \over 3} - {\alpha \over 6}}}\log n/\alpha )\) $$O(n^{\frac{2}{3}-\frac{\alpha }{6}}\log n/\alpha )$$ . We compare our algorithm with the existing static APSP algorithms in the MPC model, demonstrating the efficiency of our approach