摘要
本文首先定义一种有序有色的出树,称为V-H树。用该树描述BBL布局中的slicing结群。然后提出两种产生V-H树的递归构造法:一种是利用整数划分和迭代的方法,另一种是先分类再根据若干定理递归。最后讨论几种特殊树和BBL布局的关系。
In this paper, we define a class of ordered out-tree called V-H tree and use it to describe the slicing cluster in the BBL placement. Two methods of recursive algorithms to generate the V-H trees are presented: a partition of a positive integer and successive substitution are used in the first method and a classification of V-H trees and some theoroms are used in the second method. Finally, some special trees to be applied to the BBL placement are dicussed.
出处
《杭州大学学报（自然科学版）》
CSCD
1989年第4期404-411,共8页
Journal of Hangzhou University Natural Science Edition
