Efficient Algorithms for Constructing Very Sparse Spanners and Emulators

DOI10.1137/1.9781611974782.41zbMath1410.68382OpenAlexW2503099161MaRDI QIDQ4575779

Michael Elkin, Ofer Neiman

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.41

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Density (toughness, etc.) (05C42)

Related Items (9)

Fast Distributed Approximation for Max-Cut ⋮ Property testing of planarity in the \textsf{CONGEST} model ⋮ Time-optimal construction of overlay networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Greedy Spanner Is Existentially Optimal ⋮ Local algorithms for sparse spanning graphs ⋮ Distributed Spanner Approximation

This page was built for publication: Efficient Algorithms for Constructing Very Sparse Spanners and Emulators