Communication complexity of distributed shortest path algorithms
Abstract
A new distributed shortest path algorithm for an asynchronous communication network with unit edges, of the number of elementary messages used in finding shortest paths form a given root to all other nodes is 0(V1.6+E) where V is the number of nodes and E the number of edges. For dense networks, with E > or = V to 1.6 power, this order of complexity is optimum.
- Publication:
-
NASA STI/Recon Technical Report N
- Pub Date:
- June 1985
- Bibcode:
- 1985STIN...8535332A
- Keywords:
-
- Algorithms;
- Communication Networks;
- Complexity;
- Communication;
- Critical Path Method;
- Density (Number/Volume);
- Edges;
- Synchronism;
- Telecommunication;
- Communications and Radar