Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Hu and Torres have proposed a decomposition algorithm for finding the shortest paths between all pairs of nodes in a sparse network in which subnetworks are linearly overlapped. The purpose of this ...