Fast pruning of geometric spanners
From MaRDI portal
Recommendations
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
- I/O-Efficiently Pruning Dense Spanners
- Improved greedy algorithms for constructing sparse geometric spanners
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
Cited in
(11)- Geometric spanners in the MapReduce model
- Truly Optimal Euclidean Spanners
- Experimental Study of Geometric t-Spanners: A Running Time Comparison
- I/O-Efficiently Pruning Dense Spanners
- Light Euclidean Spanners with Steiner Points
- Fully dynamic geometric spanners
- Shortest-Path Queries in Geometric Networks
- Truly optimal Euclidean spanners
- Approximate distance oracles for graphs with dense clusters
- Well-separated pair decomposition in linear time?
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
This page was built for publication: Fast pruning of geometric spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710703)