Greedy Routing via Embedding Graphs onto Semi-metric Spaces

DOI10.1007/978-3-642-21204-8_10MaRDI QIDQ3004656zbMATH OpenOpenAlexFDO

Authors Huaming Zhang, Swetha Govindaiah

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)

Recommendations

• Greedy routing via embedding graphs onto semi-metric spaces
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• On k-greedy routing algorithms
• Algorithms – ESA 2005
• Succinct greedy geometric routing in the Euclidean plane
• Greedy routing in circulant networks
• Succinct Greedy Geometric Routing Using Hyperbolic Geometry
• On compact and efficient routing in certain graph classes
• Algorithms and Computation

Cites work

• scientific article; zbMATH DE number 5764804 (Why is no real title available?)
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• scientific article; zbMATH DE number 804357 (Why is no real title available?)
• An Algorithm to Construct Greedy Drawings of Triangulations
• Distributed computation of virtual coordinates
• Graph theory with applications
• On a conjecture related to geometric routing
• On succinct convex greedy drawing of 3-connected plane graphs
• Schnyder greedy routing algorithm
• Some results on greedy embeddings in metric spaces
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct greedy drawings do not always exist
• Succinct greedy geometric routing in the Euclidean plane
• Trees in Polyhedral Graphs

Cited in

(9)

• GEA: a greedy graph embedding algorithm.
• Greedy routing via embedding graphs onto semi-metric spaces
• On \(k\)-greedy routing algorithms
• An optimal greedy routing algorithm for triangulated polygons
• Space lower bounds for low-stretch greedy embeddings
• Space lower bounds for low-stretch greedy embeddings
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Some results on greedy embeddings in metric spaces
• Hyperbolic Embeddings for Near-Optimal Greedy Routing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004656)