Pages that link to "Item:Q4505000"
From MaRDI portal
The following pages link to Bounds For Orthogonal 3-D Graph Drawing (Q4505000):
Displaying 15 items.
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Bend-optimal orthogonal drawings of triconnected plane graphs (Q1713568) (← links)
- Embedding problems for paths with direction constrained edges. (Q1853570) (← links)
- Optimal three-dimensional orthogonal graph drawing in the general position model. (Q1874390) (← links)
- Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout (Q1889862) (← links)
- A note on 3D orthogonal graph drawing (Q2486752) (← links)
- Three-dimensional orthogonal graph drawing with optimal volume (Q2492635) (← links)
- Fully dynamic \(3\)-dimensional orthogonal graph drawing (Q2701749) (← links)
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing (Q3611839) (← links)
- New Lower Bounds For Orthogonal Drawings (Q4243440) (← links)
- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings (Q4435327) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Colorability in Orthogonal Graph Drawing (Q5452235) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)