Pages that link to "Item:Q3611834"
From MaRDI portal
The following pages link to Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834):
Displaying 19 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- 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)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- Some results on greedy embeddings in metric spaces (Q603850) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- Using the metro-map metaphor for drawing hypergraphs (Q831834) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Manhattan orbifolds (Q1044880) (← links)
- An optimal greedy routing algorithm for triangulated polygons (Q1947976) (← links)
- Limitations on realistic hyperbolic graph drawing (Q2151459) (← links)
- Every Schnyder drawing is a greedy embedding (Q2286747) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints (Q3223916) (← links)
- Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane (Q3223968) (← links)
- (Q4472321) (← links)
- (Q5140737) (← links)