Distributed computation on graphs: shortest path algorithms

  • Authors:
  • K. Mani Chandy;J. Misra

  • Affiliations:
  • Univ. of Texas, Austin;Univ. of Texas, Austin

  • Venue:
  • Communications of the ACM
  • Year:
  • 1982

Quantified Score

Hi-index 48.22

Visualization

Abstract

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.