Distributed algorithms for low stretch spanning trees
From MaRDI portal
Recommendations
- Fast deterministic distributed algorithms for sparse spanners
- 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
- A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
Cited in
(13)- Single-source shortest paths in the CONGEST model with improved bounds
- Improved distributed Steiner forest construction
- Lower-Stretch Spanning Trees
- scientific article; zbMATH DE number 3990855 (Why is no real title available?)
- Using petal-decompositions to build a low stretch spanning tree
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- Dynamic low-stretch trees via dynamic low-diameter decompositions
- Using petal-decompositions to build a low stretch spanning tree
- Randomized Lower Bound for Distributed Spanning-Tree Verification
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Brief announcement: Distributed reconfiguration of spanning trees
- Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
This page was built for publication: Distributed algorithms for low stretch spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487521)
