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.

This paper presents an algorithm for finding all shortest routes from all nodes to a given destination in N-node general networks (in which the distances of arcs can be negative).