| 求赋权图上最小树的两个算法 |
| |
| 引用本文： | 叶祥企. 求赋权图上最小树的两个算法[J]. 江西师范大学学报(自然科学版), 1996, 20(4): 334-338 |
| |
| 作者姓名： | 叶祥企 |
| |
| 作者单位： | 江西师范大学数学系 |
| |
| 摘 要： | 该文证明了赋权图上的树为最小树的一个充要条件，并由此得到求赋权图上最小树的两个算法。
|
| 关 键 词： | 赋权图 图 树 最小树 充要条件 |
Two Algorithm for Finding an Optimal Tree in a Nontrivial Weighted Connected Graph |
| |
| Ye Xiangqi. Two Algorithm for Finding an Optimal Tree in a Nontrivial Weighted Connected Graph[J]. Journal of Jiangxi Normal University (Natural Sciences Edition), 1996, 20(4): 334-338 |
| |
| Authors: | Ye Xiangqi |
| |
| Abstract: | In this paper,we prove the sufficient and necessary conditions of tree in a nontrivial weighted connected graph,which is an optimal tree,and present two algrithm for finding an optimal tree in a nontrivial weighted connected graph. |
| |
| Keywords: | weighted connected graph upper tree graph optimal tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
