Pages that link to "Item:Q4910552"
From MaRDI portal
The following pages link to The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing (Q4910552):
Displaying 10 items.
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- 1-bend 3-D orthogonal box-drawings: Two open problems solved (Q2724198) (← links)
- Three-Dimensional 1-Bend Graph Drawings (Q3378502) (← links)
- On the Hardness of Orthogonal-Order Preserving Graph Drawing (Q3611858) (← links)
- (Q4501695) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- Drawing Kn in Three Dimensions with One Bend per Edge (Q5301393) (← links)
- Optimal Orthogonal Graph Drawing with Convex Bend Costs (Q5326560) (← links)
- Graph Drawing (Q5711620) (← links)
- Graph Drawing (Q5897620) (← links)