| 最小T－2倍树的构造算法 |
| |
| 引用本文： | 樊建席. 最小T－2倍树的构造算法[J]. 青岛大学学报(自然科学版), 1996, 0(4) |
| |
| 作者姓名： | 樊建席 |
| |
| 作者单位： | 青岛大学计算机系 |
| |
| 摘 要： | 本文提出了对任意一棵树的顶点赋权使其满足一定约束条件的最小Ｔ－２倍树的定义，并给出了一个时间复杂度为Ｏ（ｎ２）的构造算法
|
| 关 键 词： | T－2倍树；权；根 |
THE CONSTRUCTING ALGORITHM OF THE SMALLEST T-2 TIMES TREES |
| |
| Fan Jianxi. THE CONSTRUCTING ALGORITHM OF THE SMALLEST T-2 TIMES TREES[J]. Journal of Qingdao University(Natural Science Edition), 1996, 0(4) |
| |
| Authors: | Fan Jianxi |
| |
| Abstract: | This paper gives a defination of the smallest T-2 times tree, which is arbitrary tree whose nodes are assigned weights satisfying given bound conditions, and a constructing algorithm whose time complexity is O(n 2) . |
| |
| Keywords: | T-2 times tree weight root |
| 本文献已被 CNKI 等数据库收录！ |
