scientific article; zbMATH DE number 7053356

zbMath1420.68157MaRDI QIDQ5743479

Sander Verdonschot, Rolf Fagerberg, André van Renssen, Prosenjit Bose

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095220

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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 algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

On plane geometric spanners: a survey and open problems ⋮ Improved routing on the Delaunay triangulation ⋮ Local routing algorithms on Euclidean spanners with small diameter ⋮ Cone-based spanners of constant degree ⋮ Towards tight bounds on theta-graphs: more is not always better ⋮ Unnamed Item ⋮ Construction and Local Routing for Angle-Monotone Graphs ⋮ Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations ⋮ The Price of Order ⋮ Drawing graphs as spanners

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on greedy embeddings in metric spaces
• Greedy drawings of triangulations
• Realizability of Delaunay triangulations
• Guide to wireless mesh networks
• Classes of graphs which approximate the complete Euclidean graph
• There are planar graphs almost as good as the complete graph
• On a conjecture related to geometric routing
• Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
• Schnyder Greedy Routing Algorithm
• Survey on Oblivious Routing Strategies
• Succinct Greedy Geometric Routing in the Euclidean Plane
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Online Routing in Triangulations
• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• An Algorithm to Construct Greedy Drawings of Triangulations

This page was built for publication: