| 有向最优树的一个新算法 |
| |
| 引用本文： | 周永务. 有向最优树的一个新算法[J]. 合肥工业大学学报(自然科学版), 1995, 0(Z1) |
| |
| 作者姓名： | 周永务 |
| |
| 摘 要： | 本文给出了有向最优树的一个新的有效算法，证明了此算法的时间复杂度为Ｏ（ｎ４），并给出一个数字例子
|
| 关 键 词： | 有向图；有向树；最优树 |
A NEW ALGORITHM FOR THE OPTIMAL DIRECTED TREE |
| |
| Zhou Yongwu. A NEW ALGORITHM FOR THE OPTIMAL DIRECTED TREE[J]. Journal of Hefei University of Technology(Natural Science), 1995, 0(Z1) |
| |
| Authors: | Zhou Yongwu |
| |
| Affiliation: | Zhou Yongwu |
| |
| Abstract: | In this paper, a new efficient algorithm for the optimal directed tree is presented.It is proved that the time complexity of this algorithm is O(n4). A numerical example is shown. |
| |
| Keywords: | irected graph direCted tree optimal tree |
| 本文献已被 CNKI 等数据库收录！ |
