A generalized greedy routing algorithm for 2-connected graphs

DOI10.1016/j.tcs.2010.08.032zbMath1213.68474OpenAlexW2083079385MaRDI QIDQ606989

Xin He, Huaming Zhang

Publication date: 19 November 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.032

zbMATH Keywords

plane graphnetwork routinggreedy routing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A simple routing algorithm based on Schnyder coordinates

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on greedy embeddings in metric spaces
• Transversal structures on triangulations: A combinatorial study and straight-line drawings
• st-ordering the vertices of biconnected graphs
• Computing an st-numbering
• Bipolar orientations revisited
• On a conjecture related to geometric routing
• Geometric ad-hoc 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
• On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks
• An Algorithm to Construct Greedy Drawings of Triangulations
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: A generalized greedy routing algorithm for 2-connected graphs