[ACM Press the 2012 ACM symposium - Made
β
Holzer, Stephan; Wattenhofer, Roger
π
Article
π
2012
π
ACM Press
π
English
β 669 KB
We present an algorithm to compute All Pairs Shortest Paths (APSP) of a network in a distributed way. The model of distributed computation we consider is the message passing model: in each synchronous round, every node can transmit a different (but short) message to each of its neighbors. We provide