Schnyder greedy routing algorithm
From MaRDI portal
Publication:3569082
Recommendations
- A simple routing algorithm based on Schnyder coordinates
- A generalized greedy routing algorithm for 2-connected graphs
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- On succinct convex greedy drawing of 3-connected plane graphs
- An optimal greedy routing algorithm for triangulated polygons
Cited in
(9)- A simple routing algorithm based on Schnyder coordinates
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces
- An optimal greedy routing algorithm for triangulated polygons
- A generalized greedy routing algorithm for 2-connected graphs
- Geographic routing on virtual raw anchor coordinate systems
- Greedy Dynamic Routing on Arrays
- Competitive routing in the half-\(\theta_6\)-graph
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Every Schnyder drawing is a greedy embedding
This page was built for publication: Schnyder greedy routing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569082)