Area-efficient planar straight-line drawings of outerplanar graphs
From MaRDI portal
Publication:885284
DOI10.1016/j.dam.2005.12.008zbMath1123.05031OpenAlexW2048639803MaRDI QIDQ885284
Publication date: 8 June 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.12.008
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (7)
Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs ⋮ ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS ⋮ Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area ⋮ Polynomial area bounds for MST embeddings of trees ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ Small area drawings of outerplanar graphs ⋮ Improved Upper and Lower Bounds for LR Drawings of Binary Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Parallel concepts in graph theory
- A near-linear area bound for drawing binary trees
- Searching among intervals and compact routing tables
- Planar graph decomposition and all pairs shortest paths
- I/O-Optimal Algorithms for Outerplanar Graphs
- Augmenting Outerplanar Graphs
- Graph-Theoretic Concepts in Computer Science
- Drawing graphs. Methods and models
This page was built for publication: Area-efficient planar straight-line drawings of outerplanar graphs