A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners

DOI10.1145/3293611.3331588zbMath1497.68368arXiv1812.05778OpenAlexW2963915537MaRDI QIDQ5145268

Greg Bodwin, Shyamal Patel

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05778

zbMATH Keywords

greedy algorithmsfault-tolerant spanners

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Graph spanners: a tutorial review ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees

This page was built for publication: A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners