Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
- Graph Drawing
- Graph Drawing
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Small-area orthogonal drawings of 3-connected graphs
- Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
- Area-efficient planar straight-line drawings of outerplanar graphs
- Drawing outer-1-planar graphs revisited
- Drawing outer-1-planar graphs revisited
- scientific article; zbMATH DE number 1974107
- Area-universal drawings of biconnected outerplane graphs
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 1974107 (Why is no real title available?)
- A linear-time algorithm for drawing a planar graph on a grid
- A near-linear area bound for drawing binary trees
- Area-efficient planar straight-line drawings of outerplanar graphs
- Graph Drawing
- How to draw a planar graph on a grid
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- Universality considerations in VLSI circuits
Cited in
(14)- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Area requirement of graph drawings with few crossings per edge
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Graph Drawing
- A 2-approximation for the height of maximal outerplanar graph drawings
- Graph Drawing
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees
- Universal point sets for planar three-trees
- Small grid drawings of planar graphs with balanced bipartition
- Polynomial area bounds for MST embeddings of trees
- Small grid drawings of planar graphs with balanced partition
- Outer 1-planar graphs
- Graph Stories in Small Area
- scientific article; zbMATH DE number 1974107 (Why is no real title available?)
This page was built for publication: Small area drawings of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024211)
