| 求树的路长序列的算法 |
| |
| 引用本文： | 刘家壮. 求树的路长序列的算法[J]. 山东大学学报(理学版), 1987, 0(3) |
| |
| 作者姓名： | 刘家壮 |
| |
| 作者单位： | 山东大学数学研究所 |
| |
| 摘 要： | 本文根据非负整数序列表示有序树、根树和树的充要条件,给出一个求树的路长序列的算法,并详细地分析了该算法的复杂性,从而得到求树的路长序列的一个相当有效的算法。
|
| 关 键 词： | 典型点 路长序列 算法复杂性 |
AN ALGORITHM FOR FINDING THE SEQUENCE OF PATH LENGTHS OF A TREE |
| |
| Liu Jiazhuang. AN ALGORITHM FOR FINDING THE SEQUENCE OF PATH LENGTHS OF A TREE[J]. Journal of Shandong University, 1987, 0(3) |
| |
| Authors: | Liu Jiazhuang |
| |
| Affiliation: | Liu Jiazhuang |
| |
| Abstract: | In this paper, On the basis of necessary and sufficient conditions for sequences of non-negative integers to be the representiv'e sequences of ordered trees or rooted trees or tr,ees,an algorithm is given for finding the Sequence of path lengths of a tree. And the complexity of this algorithm is analysed in detail. Thus a quite efficient algorithm is obtained for finding the sequence of path lengths of a tree. |
| |
| Keywords: | Typical node Sequence of path lengths Complexity of algorithm |
| 本文献已被 CNKI 等数据库收录！ |
|
