Abstract
We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a n−−√ by n−−√ grid. We also show that testing whether a given rooted binary tree has an upward embedding with a given combinatorial
... read more