Distributed computation on graphs: Shortest path algorithms
Distributed Computation on Graphs: Shortest Path Algorithms Page 1 Programming
Techniques and Data Structures M. Douglas Mcllroy* Editor Distributed Computation on
Graphs: Shortest Path Algorithms KM Chandy and J. Misra University of Texas at Austin We use
the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of
graph problems. We 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. CR Categories and …
Techniques and Data Structures M. Douglas Mcllroy* Editor Distributed Computation on
Graphs: Shortest Path Algorithms KM Chandy and J. Misra University of Texas at Austin We use
the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of
graph problems. We 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. CR Categories and …
We use the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of graph problems. We 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.
ACM Digital Library