Distributed computation on graphs

K. Mani Chandy, Jayadev Misra · Communications of the ACM · 1982

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.

Cited by 181 works. doi:10.1145/358690.358717 Open-access PDF

Authors

References