Schnyder Greedy Routing Algorithm
From MaRDI portal
Publication:3569082
DOI10.1007/978-3-642-13562-0_25zbMath1284.68051OpenAlexW1543674095MaRDI QIDQ3569082
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
Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
On succinct greedy drawings of plane triangulations and 3-connected plane graphs ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ Every Schnyder drawing is a greedy embedding ⋮ Unnamed Item
This page was built for publication: Schnyder Greedy Routing Algorithm