How to Fit a Tree in a Box

Hugo A. Akitaya,Maarten Löffler,Irene Parada

Graphs and Combinatorics（2022）

引用 1|浏览10

暂无评分

摘要

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 embedding in a given grid is NP-hard.

查看译文

关键词

Binary trees,Graph drawing,Upward drawing,Area requirement

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要