For decades, computer scientists working on negative-weight graphs tried to match the speed of Dijkstra’s algorithm with similar “combinatorial” algorithms. These involve discrete operations — like ...

The FPGA runs an algorithm for finding the shortest route between two points, called Dijkstra’s algorithm.

Project Scheduling in And-Or Graphs: A Generalization of Dijkstra's Algorithm George M. Adelson-Velsky and Eugene Levner Mathematics of Operations Research , pp. 504-517 (14 pages) ...

Edsger Dijkstra, one of the moving forces behind the acceptance of computer programming as a scientific discipline, has died. But his legacy lives on in every computer.