Pages that link to "Item:Q2445876"
From MaRDI portal
The following pages link to Succinct strictly convex greedy drawing of 3-connected plane graphs (Q2445876):
Displaying 13 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← 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)
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs (Q3183604) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q4580108) (← links)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312960) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)