Distributed Computation on Graphs: Shortest Path Algorithms

Communications of the ACM

Volumn 25, Issue 11, 1982, Pages 833-837

  Chandy, K Mani ^a   Misra, J ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

depth first search; diffusing computation; distributed computation; negative cycle; shortest path

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

COMPUTER PROGRAMMING;

EID: 0020202833     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/358690.358717     Document Type: Article

References (2)

1. Dijkstra, E.W., and Scholten, C.S. Termination detection for diffusing computations. Inf. Process. Lett 11, (Aug. 1980), 1, 1--4.
2. Ford, L.R., and Fulkerson, D.R. Flows in Networks. Princeton Univ. Press, Princeton, N. J., 1962.