Competitive routing in the half-_6-graph
zbMATH Open1420.68157MaRDI QIDQ5743479FDOQ5743479
Authors: Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot 
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095220
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
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)
Cites Work
- There are planar graphs almost as good as the complete graph
- On a conjecture related to geometric routing
- Succinct greedy geometric routing in the Euclidean plane
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- An Algorithm to Construct Greedy Drawings of Triangulations
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- Realizability of Delaunay triangulations
- Title not available (Why is that?)
- Classes of graphs which approximate the complete Euclidean graph
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- On succinct convex greedy drawing of 3-connected plane graphs
- Schnyder greedy routing algorithm
- Online Routing in Triangulations
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- Guide to wireless mesh networks
- Survey on oblivious routing strategies
Cited In (14)
- Improved routing on the Delaunay triangulation
- Towards tight bounds on theta-graphs: more is not always better
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Local routing algorithms on Euclidean spanners with small diameter
- Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph
- Drawing graphs as spanners
- The price of order
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations
- 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)
