Distributed Computation on Graphs: Shortest Path Algorithms

摘要

The authors use the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of graph problems. They present a detailed solution to the problem of computing shortest paths from a single vertex to all other vertices, in the presence of negative cycles. (Author)