Greedy Routing via Embedding Graphs onto Semi-metric Spaces
DOI10.1007/978-3-642-21204-8_10zbMATH Open1329.90155OpenAlexW2396752572MaRDI QIDQ3004656FDOQ3004656
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
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Graph theory with applications
- On a conjecture related to geometric routing
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Succinct greedy geometric routing in the Euclidean plane
- Some results on greedy embeddings in metric spaces
- Title not available (Why is that?)
- Succinct greedy drawings do not always exist
- Title not available (Why is that?)
- Distributed computation of virtual coordinates
- On succinct convex greedy drawing of 3-connected plane graphs
- Trees in Polyhedral Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- Schnyder greedy routing algorithm
- Title not available (Why is that?)
Cited In (9)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- On \(k\)-greedy routing algorithms
- Greedy routing via embedding graphs onto semi-metric spaces
- Some results on greedy embeddings in metric spaces
- GEA: a greedy graph embedding algorithm.
- Space lower bounds for low-stretch greedy embeddings
- Space lower bounds for low-stretch greedy embeddings
- An optimal greedy routing algorithm for triangulated polygons
- 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)
