Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
From MaRDI portal
Recommendations
Cited in
(16)- Graph spanners: a tutorial review
- Fast deterministic distributed algorithms for sparse spanners
- 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
- Near-additive spanners in low polynomial deterministic CONGEST time
- Derandomizing distributed algorithms with small messages: spanners and dominating set
- Distributed algorithms for low stretch spanning trees
- The sparsest additive spanner via multiple weighted BFS trees
- Sublinear fully distributed partition with applications
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees
- 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 computation algorithms for spanners
This page was built for publication: Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523207)