摘要
度约束最小生成树问题是网络优化中一个常见的问题,本文介绍了度约束最小生成树问题的数学模型,对度约束最小生成树问题求解方法进行了综述,给出了一个新的快速算法QDC。
Degree constrained minimum spanning tree (DCMST) case is a common problem in network optimi- zation. This paper introduces the mathematical models of the degree constrained minimum spanning tree problem, the associated degree constrained minimum spanning tree problem solving methods are reviewed, given a new fast algorithm QDC.
出处
《阴山学刊(自然科学版)》
2015年第4期30-32,共3页
Yinshan Academic Journal(Natural Science Edition)
关键词
度约束
最小生成树
快速算法
Degree constrained
Minimum spanning tree
Fast algorithm