A simple routing algorithm based on Schnyder coordinates
From MaRDI portal
Publication:391094
DOI10.1016/j.tcs.2013.01.017zbMath1294.68036OpenAlexW2047215131MaRDI QIDQ391094
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.017
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles, Every Schnyder drawing is a greedy embedding, Geographic routing on virtual raw anchor coordinate systems
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed computation of virtual coordinates for greedy routing in sensor networks
- Some results on greedy embeddings in metric spaces
- A generalized greedy routing algorithm for 2-connected graphs
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Greedy drawings of triangulations
- Convex drawings of 3-connected plane graphs
- Schnyder woods and orthogonal surfaces
- Planar graphs and poset dimension
- Output-sensitive reporting of disjoint paths
- Geodesic embeddings and planar graphs
- On a conjecture related to geometric routing
- Succinct Greedy Drawings Do Not Always Exist
- Distributed computation of virtual coordinates
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Succinct Greedy Geometric Routing in the Euclidean Plane
- An Algorithm to Construct Greedy Drawings of Triangulations
- Convex drawings of planar graphs and the order dimension of 3-polytopes
