Pages that link to "Item:Q5057437"
From MaRDI portal
The following pages link to Computing proximity drawings of trees in the 3-dimensional space (Q5057437):
Displayed 13 items.
- 3D straight-line grid drawing of 4-colorable graphs (Q287145) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- The strength of weak proximity (Q849629) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Computing proximity drawings of trees in the 3-dimensional space (Q5057437) (← links)
- Equilateral Spherical Drawings of Planar Cayley Graphs (Q5144883) (← links)
- Polynomial Area Bounds for MST Embeddings of Trees (Q5452214) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)