Fast Deterministic Distributed Algorithms for Sparse Spanners
From MaRDI portal
Recommendations
- Fast deterministic distributed algorithms for sparse spanners
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
- On the locality of distributed sparse spanner construction
- Improved deterministic distributed construction of spanners
- Local Computation of Nearly Additive Spanners
Cited in
(19)- A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
- Sparser: A Paradigm for Running Distributed Algorithms
- Fast deterministic distributed algorithms for sparse spanners
- Improved deterministic distributed construction of spanners
- Derandomizing local distributed algorithms under bandwidth restrictions
- Congested clique algorithms for graph spanners
- Distributed spanner approximation
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
- Derandomizing distributed algorithms with small messages: spanners and dominating set
- Distributed algorithms for low stretch spanning trees
- Simple distributed spanners in dense congest networks
- Efficient algorithms for constructing very sparse spanners and emulators
- Efficient algorithms for constructing very sparse spanners and emulators
- Sublinear fully distributed partition with applications
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- On the locality of distributed sparse spanner construction
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Local Maps: New Insights into Mobile Agent Algorithms
- Distributed Spanner Approximation
This page was built for publication: Fast Deterministic Distributed Algorithms for Sparse Spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613647)