A note on optimal area algorithms for upward drawings of binary trees
type: Item
instance of: scholarly article
title: A note on optimal area algorithms for upward drawings of binary trees
zbMATH Open document ID: 0768.68131
DOI: 10.1016/0925-7721(92)90021-J
author: Pilu Crescenzi
author: Giuseppe Di Battista
author: Adolfo Piperno
published in: Computational Geometry
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 166437
zbMATH Keywords: upward drawing
zbMATH Keywords: area requirement
zbMATH Keywords: grid drawings
zbMATH Keywords: binary trees
zbMATH Keywords: Fibonacci trees
MaRDI profile type: Publication
cites work: The Area-Time Complexity of Binary Multiplication
cites work: Bipartite graphs, upward drawings, and planarity
cites work: Algorithms for plane representations of acyclic digraphs
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Q3953687
cites work: Q4750643
cites work: Q4040797
cites work: Q3138955
cites work: Fundamentals of planar ordered sets
cites work: Planar Lattices
cites work: Q5585020
cites work: Q4729805
cites work: Q3222890
cites work: Q4918384
cites work: Q3138887
cites work: The complexity of drawing trees nicely
cites work: Planar acyclic oriented graphs
cites work: Q3326832
cites work: Pretty-printing of trees
cites work: Tidy Drawings of Trees
Wikidata QID: Q126819213
full work available at URL: 0925-7721(92)90021-j
OpenAlex ID: W1971486096
description: scientific article; zbMATH DE number 166437