Pages that link to "Item:Q3652264"
From MaRDI portal
The following pages link to Succinct Greedy Geometric Routing in the Euclidean Plane (Q3652264):
Displaying 22 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)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- On the plane angle-monotone graphs (Q824336) (← links)
- Angle-monotonicity of Delaunay triangulation (Q827337) (← links)
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- An optimal greedy routing algorithm for triangulated polygons (Q1947976) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Every Schnyder drawing is a greedy embedding (Q2286747) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Succinct strictly convex greedy drawing of 3-connected plane graphs (Q2445876) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- (Q5743479) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)