Distributed algorithms for ultrasparse spanners and linear size skeletons
From MaRDI portal
(Redirected from Publication:5892001)
Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15) Analysis of algorithms (68W40)
Recommendations
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Fast deterministic distributed algorithms for sparse spanners
- Fast Deterministic Distributed Algorithms for Sparse Spanners
- Distributed spanner approximation
- Distributed Spanner Approximation
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
- scientific article; zbMATH DE number 2079403
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
- Improved deterministic distributed construction of spanners
Cited in
(7)- Sublinear fully distributed partition with applications
- Graph spanners: a tutorial review
- scientific article; zbMATH DE number 2036580 (Why is no real title available?)
- Distributed Spanner Approximation
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Distributed constructions of dual-failure fault-tolerant distance preservers
- On the size overhead of pairwise spanners
This page was built for publication: Distributed algorithms for ultrasparse spanners and linear size skeletons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892001)
