摘要
最小树及其算法是图论研究的重要内容之一,迭代思想是网络优化的基本思想,从任意生成树出发,若它不是最小树,利用迭代规则得到一棵更小的生成树;本文引入了关于连枝的迭代法和关于树枝的迭代法并给出了从一棵生成树中找最小树的新的方法,这种方法在网络设计有重要的应用。
Minimum spanning tree and its algorithm is one of the important subjects in the study of graph theory. The iterative algorithm is the basic method for network optimization. For any spanning tree, if not the maximum, we ean get a smaller one by iteration rule. We introduce iterative methods in terms of nontree edge and tree edge,and offer a new method to find the mini-mum tree from a spanning tree. The method has important application in the design of network.
出处
《石河子大学学报（自然科学版）》
CAS
2013年第2期262-264,共3页
Journal of Shihezi University(Natural Science)
关键词
网络优化
最小树
迭代法
network optimization
minimum spanning tree
iterative algorithm
