Pages that link to "Item:Q5901462"
From MaRDI portal
The following pages link to An Algorithm to Construct Greedy Drawings of Triangulations (Q5901462):
Displaying 12 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)
- Distributed computation of virtual coordinates for greedy routing in sensor networks (Q531593) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- An optimal greedy routing algorithm for triangulated polygons (Q1947976) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- (Q5442375) (← links)
- Graph Drawing (Q5711616) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052) (← links)