Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time

DOI10.1145/3293611.3331635zbMath1506.68071arXiv1903.00872OpenAlexW2963232515MaRDI QIDQ5145266

Shaked Matar, Michael Elkin

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/1903.00872

zbMATH Keywords

graph spannersdeterministic timeCongest

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Graph spanners: a tutorial review

This page was built for publication: Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time