Improved deterministic distributed construction of spanners
From MaRDI portal
Recommendations
- On the locality of distributed sparse spanner construction
- Fast deterministic distributed algorithms for sparse spanners
- Fast Deterministic Distributed Algorithms for Sparse Spanners
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
- Congested clique algorithms for graph spanners
Cited in
(18)- The sparsest additive spanner via multiple weighted BFS trees
- Distributed construction of low-interference spanners
- Deterministic improved round-trip spanners
- On the locality of distributed sparse spanner construction
- Simple distributed spanners in dense congest networks
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
- Fast Deterministic Distributed Algorithms for Sparse Spanners
- Distributed spanner approximation
- Derandomizing distributed algorithms with small messages: spanners and dominating set
- Congested clique algorithms for graph spanners
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees
- Message Reduction in the LOCAL Model is a Free Lunch
- Distributed Spanner Approximation
- Distribution-sensitive construction of the greedy spanner
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Simple dynamic spanners with near-optimal recourse against an adaptive adversary
- Minimizing recourse in an adaptive balls and bins game
- Fast deterministic distributed algorithms for sparse spanners
This page was built for publication: Improved deterministic distributed construction of spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487496)
