CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
From MaRDI portal
Recommendations
Cited in
(23)- Region-fault tolerant geometric spanners
- On sparse spanners of weighted graphs
- Approximating Euclidean distances by small degree graphs
- Euclidean spanner graphs with degree four
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions
- Average stretch factor: how low does it go?
- Efficient construction of a bounded-degree spanner with low weight
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- ON SPANNERS OF GEOMETRIC GRAPHS
- Spanners of Complete k-Partite Geometric Graphs
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- MIXED SPANNING TREES IN THEORY AND PRACTICE
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
- Simple greedy algorithms for fundamental multidimensional graph problems
- Spanners of Complete k-Partite Geometric Graphs
- Small hop-diameter sparse spanners for doubling metrics
- Fully dynamic geometric spanners
- Lower bounds for computing geometric spanners and approximate shortest paths
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
- Spanners under the Hausdorff and Fréchet distances
- Sparse geometric graphs with small dilation
- I/O-efficient algorithms for computing planar geometric spanners
- Computing a minimum-dilation spanning tree is NP-hard
This page was built for publication: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986395)
