Award-winning advance increases network performance, that could mean faster response times for drone navigation, telecoms, disaster evacuation.

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

But solving the single source shortest path problem has allowed researchers to create a superb algorithm that becomes almost impossible to beat with regards to speed.

Unfortunately, prior research does not provide a clear direction for choosing an algorithm when one faces the problem of computing shortest paths on real road networks. Most of the computational ...

The computation of point-to-point shortest paths on time-dependent transportation networks has many practical applications. Finding the shortest path on transportation networks, taking into account ...

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.