Bounding the locality of distributed routing algorithms

DOI10.1145/1582716.1582756zbMath1291.68296OpenAlexW2066256226MaRDI QIDQ5170322

Prosenjit Bose, Stephane Durocher, Paz Carmi

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1582716.1582756

zbMATH Keywords

dilationdistributed algorithmslocal routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (1)

Bounding the locality of distributed routing algorithms

This page was built for publication: Bounding the locality of distributed routing algorithms