Dynamic low-stretch trees via dynamic low-diameter decompositions

DOI10.1145/3313276.3316381zbMath1433.68639arXiv1804.04928OpenAlexW3101090353MaRDI QIDQ5212779

Sebastian Forster, Gramoz Goranci

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

spannerlow-diameter decompositionlow-stretch tree

Mathematics Subject Classification ID

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

Related Items

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions