A framework for computing the greedy spanner
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)
Recommendations
Cited in
(15)- Computing the greedy spanner in near-quadratic time
- Measuring sample quality with diffusions
- \(\delta\)-greedy \(t\)-spanner
- Computing the greedy spanner in linear space
- Distribution-sensitive construction of the greedy spanner
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
- Visualization of geometric spanner algorithms
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- Computing the Greedy Spanner in Near-Quadratic Time
- Greedy spanners are optimal in doubling metrics
- Distribution-sensitive construction of the greedy spanner
- A simple and efficient method for accelerating construction of the gap-greedy spanner
- Spanner approximations in practice
- Further acceleration in computing the gap greedy spanner: an empirical approach
- Computing the greedy spanner in linear space
This page was built for publication: A framework for computing the greedy spanner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635523)
