A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

So all shortest paths must be of length at most k. <BR><BR>One solution, which works well for small k, is to run the Bellman-Ford algorithm (slightly modified) for k steps. This takes O (km) time.

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

This is a preview. Log in through your library . Abstract In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms ...