Home → Magazine Archive → November 1982 (Vol. 25, No. 11) → Distributed computation on graphs: shortest path algorithms → Abstract

Distributed computation on graphs: shortest path algorithms

By K. Mani Chandy, J. Misra

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

Save PDF
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


No entries found