| 改进的Glover-Klingman算法 |
| |
| 引用本文： | 焦森林,刘红卫,孙小军.改进的Glover-Klingman算法[J].西安文理学院学报,2007,10(3):32-35. |
| |
| 作者姓名： | 焦森林 刘红卫 孙小军 |
| |
| 作者单位： | 西安电子科技大学理学院 陕西西安710071(焦森林，刘红卫)，宝鸡文理学院数学系 陕西宝鸡721007(孙小军) |
| |
| 摘 要： | 针对Glover-Klingman算法运行时间长的缺点,对Glover-Klingman算法进行了改进,改进后的算法能快速地找到最小度限制树.仿真结果表明了新算法的有效的性,且仿真结果与新算法的预期效果是一致的.
|
| 关 键 词： | Glover-Klingman算法 最小生成树 网络 |
| 文章编号： | 1008-5564（2007）03-0032-04 |
| 修稿时间： | 2007-03-28 |
An Improved Algorithm Based on Glover-Klingman |
| |
| JIAO Sen-lin,LIU Hong-wei,SUN Xiao-jun.An Improved Algorithm Based on Glover-Klingman[J].Journal of Xi‘an University of Arts & Science:Natural Science Edition,2007,10(3):32-35. |
| |
| Authors: | JIAO Sen-lin LIU Hong-wei SUN Xiao-jun |
| |
| Abstract: | This paper offers an improved algorithm since Glover-klingman algorithm takes longer time.Improved algorithm may quickly obtain-degree-constrained minimum spanning.Numerous experiments show that the improved algorithm is effective and successfully extraordinary.And the results of the experiment coincide with the expected results of the improved algorithm. |
| |
| Keywords: | Glover-Klingman algorithm Minimum spanning tree Network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
