LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
From MaRDI portal
Publication:2009630
DOI10.1016/j.jcss.2019.08.001zbMath1436.68236arXiv1610.02841OpenAlexW4285707433WikidataQ127405722 ScholiaQ127405722MaRDI QIDQ2009630
Vincenzo Roselli, Maurizio Patrignani, Fabrizio Frati
Publication date: 29 November 2019
Published in: Journal of Computer and System Sciences, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02841
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Drawing Halin-graphs with small height, Optimal-area visibility representations of outer-1-plane graphs, Tree drawings revisited, On the area requirements of planar straight-line orthogonal drawings of ternary trees, Unnamed Item, Visualizing co-phylogenetic reconciliations, Improved Upper and Lower Bounds for LR Drawings of Binary Trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Area-efficient planar straight-line drawings of outerplanar graphs
- Small area drawings of outerplanar graphs
- Gauss and the invention of least squares
- A note on optimal area algorithms for upward drawings of binary trees
- Generating random binary trees -- a survey
- A near-linear area bound for drawing binary trees
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- Universality considerations in VLSI circuits
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
- Drawing graphs. Methods and models
