Pages that link to "Item:Q476437"
From MaRDI portal
The following pages link to On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437):
Displaying 20 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- Greedy routing via embedding graphs onto semi-metric spaces (Q388089) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- Greedy drawings of triangulations (Q848683) (← 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)
- Succinct strictly convex greedy drawing of 3-connected plane graphs (Q2445876) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs (Q2936956) (← links)
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments (Q2959747) (← links)
- On self-approaching and increasing-chord drawings of 3-connected planar graphs (Q2970443) (← links)
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs (Q3183604) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q4580108) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)