Schnyder greedy routing algorithm

DOI10.1007/978-3-642-13562-0_25MaRDI QIDQ3569082zbMATH OpenOpenAlexFDO

Authors Xin He, Huaming Zhang

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10)

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)