Greedy Routing via Embedding Graphs onto Semi-metric Spaces

DOI10.1007/978-3-642-21204-8_10zbMath1329.90155OpenAlexW2396752572MaRDI QIDQ3004656

Swetha Govindaiah, Huaming Zhang

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Some results on greedy embeddings in metric spaces
• On a conjecture related to geometric routing
• Succinct Greedy Drawings Do Not Always Exist
• Schnyder Greedy Routing Algorithm
• Distributed computation of virtual coordinates
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct Greedy Geometric Routing in the Euclidean Plane
• Trees in Polyhedral Graphs
• An Algorithm to Construct Greedy Drawings of Triangulations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy Routing via Embedding Graphs onto Semi-metric Spaces