@article{9878d43ecd354e4eb60c82fa3ffe7fad,
title = "Distributed distance computation and routing with small messages",
abstract = "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.",
keywords = "All-pairs shortest paths, CONGEST model, Compact routing, Single-souce shortest paths, Skeleton spanner, Source detection",
author = "Christoph Lenzen and Boaz Patt-Shamir and David Peleg",
note = "Publisher Copyright: {\textcopyright} 2018, The Author(s).",
year = "2019",
month = apr,
day = "8",
doi = "10.1007/s00446-018-0326-6",
language = "אנגלית",
volume = "32",
pages = "133--157",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "2",
}