On the complexity of optimal drawings of graphs
From MaRDI portal
Recommendations
Cited in
(19)- Fixed edge-length graph drawing is NP-hard
- On the complexity of drawing trees nicely: Corrigendum
- The complexity of drawing graphs on few lines and few planes
- On the typical case complexity of graph optimization
- On multi-objective optimization aided drawing of special graphs
- Über 1-optimale Graphen
- scientific article; zbMATH DE number 3860848 (Why is no real title available?)
- On minimal-node-cost planar embeddings
- Drawability of Complete Graphs Using a Minimal Slope Set
- On the Hardness of Orthogonal-Order Preserving Graph Drawing
- Drawing (Complete) Binary Tanglegrams
- Hypergraph planarity and the complexity of drawing venn diagrams
- scientific article; zbMATH DE number 1156579 (Why is no real title available?)
- -searchlight obedient graph drawings
- The optimal drawings of \(K_{5,n}\)
- On Area-Optimal Planar Graph Drawings
- scientific article; zbMATH DE number 2196291 (Why is no real title available?)
- Graph Drawing
- Graph Drawing
This page was built for publication: On the complexity of optimal drawings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694750)