Pages that link to "Item:Q603850"
From MaRDI portal
The following pages link to Some results on greedy embeddings in metric spaces (Q603850):
Displayed 13 items.
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Greedy routing via embedding graphs onto semi-metric spaces (Q388089) (← links)
- A simple routing algorithm based on Schnyder coordinates (Q391094) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Distributed computation of virtual coordinates for greedy routing in sensor networks (Q531593) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- An optimal greedy routing algorithm for triangulated polygons (Q1947976) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5901462) (← links)