The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.

Given an n-node network with lengths associated with arcs: the problem is to find the shortest paths between every pair of nodes in the network. If the network has less than n (n-1) arcs, then it is ...