On Spanners of Geometric Graphs
From MaRDI portal
Recommendations
Cited in
(20)- Geometric spanners in the MapReduce model
- A lower bound for computing geometric spanners
- Lower bound for sparse Euclidean spanners
- On Pairwise Spanners
- Spanners for geometric intersection graphs with applications
- On spanners and lightweight spanners of geometric graphs
- Simplified emanation graphs: a sparse plane spanner with Steiner points
- Computing Lightweight Spanners Locally
- On plane geometric spanners: a survey and open problems
- Spanners for Geometric Intersection Graphs
- ON SPANNERS OF GEOMETRIC GRAPHS
- scientific article; zbMATH DE number 2014449 (Why is no real title available?)
- On geometric spanners of Euclidean and unit disk graphs
- Geometric Spanners with Small Chromatic Number
- Spanners of Complete k-Partite Geometric Graphs
- Spanning triangulations in graphs
- On a family of strong geometric spanners that admit local routing strategies
- Improved local algorithms for spanner construction
- Sparse hop spanners for unit disk graphs
- Geometric spanners with applications in wireless networks
This page was built for publication: On Spanners of Geometric Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630189)