On a family of strong geometric spanners that admit local routing strategies
From MaRDI portal
Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
- Local routing algorithms on Euclidean spanners with small diameter
- Local Routing in Sparse and Lightweight Geometric Graphs
- Local routing in sparse and lightweight geometric graphs
- On path-greedy geometric spanners
- Local routing in a tree metric 1-spanner
- Local geometric spanners
- Local routing in a tree metric 1-spanner
- Lower bounds for computing geometric spanners and approximate shortest paths
- On Spanners of Geometric Graphs
Cites work
- Approximating geometric bottleneck shortest paths
- Classes of graphs which approximate the complete Euclidean graph
- Empty region graphs
- Geometric Spanner Networks
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- Online Routing in Triangulations
Cited in
(3)
This page was built for publication: On a family of strong geometric spanners that admit local routing strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551501)