Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
From MaRDI portal
Publication:6201972
DOI10.1145/3465084.3467913arXiv2102.10174OpenAlexW3184184852MaRDI QIDQ6201972
Publication date: 26 March 2024
Published in: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10174
fault tolerancedistributed algorithmsspannerslabeling schemesreplacement pathsshortest path tiebreaking
This page was built for publication: Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs