| 带有边集限制的最均匀支撑树问题 |
| |
| 引用本文： | 王芳,谢政,梁兆健.带有边集限制的最均匀支撑树问题[J].数学理论与应用,2004,24(2):100-103. |
| |
| 作者姓名： | 王芳 谢政 梁兆健 |
| |
| 作者单位： | 国防科技大学理学院，长沙，410073 |
| |
| 摘 要： | 本在无向网络中，建立了带有边集限制的最均匀支撑树问题的网络模型．中首先解决最均匀支撑树问题，并给出求无向网络中最均匀支撑树的多项式时间算法；然后，给出了求无向网络中带有边集限制的最小树多项式时间算法；最后，在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题．
|
| 关 键 词： | 最均匀支撑树 无向网络 边集限制 网络模型 均匀度 |
Minimal Balanced Degree Spanning Tree with edge set Restricted Problem |
| |
| Wang Fang Xie Zheng Liang Zhaojian.Minimal Balanced Degree Spanning Tree with edge set Restricted Problem[J].Mathematical Theory and Applications,2004,24(2):100-103. |
| |
| Authors: | Wang Fang Xie Zheng Liang Zhaojian |
| |
| Abstract: | In this paper,we construct the network model of the minimal balanced degree spanning tree with edge set restricted problem in the undirected network.We give a polynomial time algorithm to solve the minimal balanced degree problem.Then we give a polynomial time algorithm to solve the minimal weight spanning tree with edge set restricted problem.At last we solve the minimal balanced degree spanning tree with edge set restricted problem based on the two solved problems. |
| |
| Keywords: | undirected network balanced degree minimal balanced degree spanning tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
