Distributed computation on graphs: shortest path algorithms

By K. Mani Chandy, J. Misra

Communications of the ACM, Vol. 25 No. 11, Pages 833-837
10.1145/358690.358717

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.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

Distributed computation on graphs: shortest path algorithms

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine