In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

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 ...

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.

The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important ...

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 ...