Schnyder greedy routing algorithm
From MaRDI portal
Publication:3569082
DOI10.1007/978-3-642-13562-0_25zbMATH Open1284.68051OpenAlexW1543674095MaRDI QIDQ3569082FDOQ3569082
Publication date: 17 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_25
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
Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10)
Cited In (7)
- A simple routing algorithm based on Schnyder coordinates
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Every Schnyder drawing is a greedy embedding
- Title not available (Why is that?)
- An optimal greedy routing algorithm for triangulated polygons
- Greedy Dynamic Routing on Arrays
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces
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)
