Jonker, R. and Volgenant, A. (1987) A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing, 38, 325-340.

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.

Quantum physicists have developed an algorithm that uses a single qubit to solve a problem that had previously needed thousands of them.

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.

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.

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra ...

Arising from the need of all time for optimization of irrigation systems, distribution network and cable network, the Cluster Shortest Path Tree Problem (CSTP) has been attracting a lot of attention ...