News

Hosted on MSN10mon
Improved algorithm in parallel computation model is faster than existing static parallel APSP algorithms
The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing ... (such as the restricted Bellman-Ford algorithm) and the ...
EurekAlert!10mon
Massively parallel algorithms for fully dynamic all-pairs shortest paths
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.