Distributed Shortest Path Algorithms
Consider a graph G(V,E) with a distinguished node called the root and with some positive weight associated with each direction on each edge. The length of a path in the graph is the sum of the weights in the direction of the path over the edges of the path. The shortest path problem is to find a minimum weight path from each node to the root. In the special case where each edge has unit weight, we call the shortest path problem the minimum hop problem.
- G. Frederickson, “A Single Source Shortest Path Algorithm for a Planar Distributed Network,” in Proceedings of the 2nd Symposium on Theoretical Aspects of Computer Science, Jan. 1985.Google Scholar
- B. Awerbuch and R.G. Gallager, “Communication Complexity of Distributed Shortest Path Algorithms,” MIT Technical Report LIDS- P-1473, June 1985.Google Scholar
- B. Awerbuch and R.G. Gallager, “Distributed BFS Algorithms,” in IEEE Symposium on the Foundations of Computer Science, Oct. 1985.Google Scholar