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.

Among these, shortest path queries are instrumental in identifying the most efficient routes within a network, thereby reducing cost, time and resource consumption.

Shuijian Zhang, Xuejun Liu, Meizhen Wang, A Novel Ant Colony Optimization Algorithm For The Shortest-path Problem In Traffic Networks, Filomat, Vol. 32, No. 5 (2018), pp. 1619-1628 ...

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.

This paper treats five discrete shortest-path problems: (1) determining the shortest path between two specified nodes of a network; (2) determining the shortest paths between all pairs of nodes of a ...

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.

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network ...