We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an O(log n) -bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications.
|Number of pages||25|
|State||Published - 8 Apr 2019|
Bibliographical noteFunding Information:
This article is based on preliminary results appearing at conferences [32,34,35]. This work has been supported by the Swiss National Science Foundation (SNSF), the Swiss Society of Friends of the Weizmann Institute of Science, the Deutsche Forschungsgemeinschaft (DFG, reference number Le 3107/1-1), the Israel Science Foundation (Grants 894/09 and 1444/14), the United States-Israel Binational Science Foundation (Grant 2008348), the Israel Ministry of Science and Technology (infrastructures grant), the Citi Foundation, and the I-CORE program of the Israel PBC and ISF (Grant 4/11).
Open access funding provided by Max Planck Society.
© 2018, The Author(s).
- All-pairs shortest paths
- CONGEST model
- Compact routing
- Single-souce shortest paths
- Skeleton spanner
- Source detection