Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
From MaRDI portal
Publication:5501495
DOI10.1145/1011767.1011791zbMath1321.68462OpenAlexW2122632420MaRDI QIDQ5501495
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011791
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items
Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models, Sublinear fully distributed partition with applications, Fast deterministic distributed algorithms for sparse spanners, New results for finding common neighborhoods in massive graphs in the data stream model, Multipath Spanners via Fault-Tolerant Spanners, Distributed Spanner Approximation