Every Schnyder drawing is a greedy embedding
From MaRDI portal
Publication:2286747
DOI10.1016/j.tcs.2019.07.021zbMath1436.68250arXiv1609.04173OpenAlexW2964283471WikidataQ127489848 ScholiaQ127489848MaRDI QIDQ2286747
Kasun Samarasinghe, Pierre Leone, José D. P. Rolim
Publication date: 22 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04173
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- A simple routing algorithm based on Schnyder coordinates
- On the efficiency of routing in sensor networks
- Some results on greedy embeddings in metric spaces
- Virtual raw anchor coordinates: a new localization paradigm
- Greedy drawings of triangulations
- Planar graphs and poset dimension
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Monotone Drawings of 3-Connected Plane Graphs
- Schnyder Greedy Routing Algorithm
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Succinct Greedy Geometric Routing in the Euclidean Plane
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Algorithmic Aspects of Wireless Sensor Networks
- An Algorithm to Construct Greedy Drawings of Triangulations
- Greedy rectilinear drawings
- Routing with guaranteed delivery in ad hoc wireless networks
- Geographic routing on virtual raw anchor coordinate systems
This page was built for publication: Every Schnyder drawing is a greedy embedding
