Straight-line drawings of outerplanar graphs in O(dn n) area
From MaRDI portal
Publication:452455
Recommendations
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 Note on Minimum-Area Straight-Line Drawings of Planar Graphs
- A note on optimal area algorithms for upward drawings of binary trees
- Area-efficient planar straight-line drawings of outerplanar graphs
- Graph Drawing
- Graph Drawing
- How to draw a planar graph on a grid
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Small area drawings of outerplanar graphs
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
- Triangulating planar graphs while minimizing the maximum degree
Cited in
(15)- A linear-time algorithm for testing outer-1-planarity
- Outer 1-planar graphs
- scientific article; zbMATH DE number 1974107 (Why is no real title available?)
- Graph Drawing
- Graph Drawing
- Area-efficient planar straight-line drawings of outerplanar graphs
- On some properties of doughnut graphs
- Drawing Halin-graphs with small height
- Planar rectilinear drawings of outerplanar graphs in linear time
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time
- Area requirement of graph drawings with few crossings per edge
- On some properties of doughnut graphs (extended abstract)
- Drawing graphs in the plane with a prescribed outer face and polynomial area
- SOFSEM 2005: Theory and Practice of Computer Science
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
This page was built for publication: Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452455)