How to Fit a Tree in a Box
arXiv:1808.10572
Abstract
We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with nodes can be drawn on a by grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard.
Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)