文章基本信息

标题：Optimizing the Layout of a Balanced Tree
本地全文：下载
作者：Robert Albin Legenstein ; Wolfgang Maass
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：It is shown that the total wire length of layouts of a balanced binary tree on a 2-dimensional grid can be reduced by 33% if one does not choose the obvious ``symmetric'' layout strategy. Furthermore it is shown that the more efficient layout strategy that is presented in this article is optimal, not only for binary trees but for m-ary trees with any m >= 2.
关键词：balanced tree , graph drawing , layout , total wire length