Distributed Computation on Graphs: Shortest Path Algorithms.

Autor: Chandy, K. Mani, Misra, J., McIlroy, M. Douglas
Předmět:
Zdroj: Communications of the ACM; Nov82, Vol. 25 Issue 11, p833-837, 5p, 1 Diagram, 4 Charts, 1 Graph
Abstrakt: Presents the distributed algorithms used to solve graph problems using networks of communicating processes. Solution for the shortest paths in a directed graph; Applications of the algorithms on undirected graph; Reasons for the arbitrary delay in message sending process.
Databáze: Complementary Index