Competitive routing in the half-_6-graph
From MaRDI portal
Publication:5743479
Graph algorithms (graph-theoretic aspects) (05C85) 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) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs
- Competitive local routing with constraints
- Competitive local routing with constraints
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- An Algorithm to Construct Greedy Drawings of Triangulations
- Classes of graphs which approximate the complete Euclidean graph
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- Greedy drawings of triangulations
- Guide to wireless mesh networks
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On a conjecture related to geometric routing
- On succinct convex greedy drawing of 3-connected plane graphs
- Online Routing in Triangulations
- Realizability of Delaunay triangulations
- Schnyder greedy routing algorithm
- Some results on greedy embeddings in metric spaces
- Succinct greedy geometric routing in the Euclidean plane
- Survey on oblivious routing strategies
- There are planar graphs almost as good as the complete graph
Cited in
(14)- Towards tight bounds on theta-graphs: more is not always better
- Improved routing on the Delaunay triangulation
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs
- Local routing algorithms on Euclidean spanners with small diameter
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph
- Drawing graphs as spanners
- Tight stretch factors for L₁- and L_-Delaunay triangulations
- The price of order
- On plane geometric spanners: a survey and open problems
- Improved routing on the Delaunay triangulation
- Cone-based spanners of constant degree
- Construction and Local Routing for Angle-Monotone Graphs
This page was built for publication: Competitive routing in the half-\(\theta_6\)-graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743479)
