Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The effect of algebraic structure on the computational complexity of matrix multiplication
The effect of algebraic structure on the computational complexity of matrix multiplication
On finding and updating shortest paths and spanning trees
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
An Improved Distribution Algorithm for Shortest Paths Problem
IEEE Transactions on Computers
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 14.98 |
Assuming that there is one processor at each vertex and all of these processors are synchronized, we can have a distributed algorithm for finding all the shortest paths in time O( d · p2) where d is the maximum of the degrees of vertices and p is the number of vertices.