Efficient algorithms for constructing very sparse spanners and emulators
DOI10.1137/1.9781611974782.41zbMATH Open1410.68382OpenAlexW2503099161MaRDI QIDQ4575779FDOQ4575779
Authors: 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
Recommendations
- Efficient algorithms for constructing very sparse spanners and emulators
- Fast deterministic distributed algorithms for sparse spanners
- Fast Deterministic Distributed Algorithms for Sparse Spanners
- On the locality of distributed sparse spanner construction
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Density (toughness, etc.) (05C42) Distributed algorithms (68W15)
Cited In (14)
- Fast Distributed Approximation for Max-Cut
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
- Distributed spanner approximation
- A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error
- Title not available (Why is that?)
- Very sparse additive spanners and emulators
- Efficient algorithms for constructing very sparse spanners and emulators
- Property testing of planarity in the \textsf{CONGEST} model
- A unified framework for light spanners
- Local computation algorithms for spanners
- The greedy spanner is existentially optimal
- Local algorithms for sparse spanning graphs
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- Title not available (Why is that?)
This page was built for publication: Efficient algorithms for constructing very sparse spanners and emulators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575779)
