ACM

Communications of the ACM

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, November 1982, Vol. 25 No. 11, Pages 833-837
10.1145/358690.358717
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.