A new algorithm for degree-constrained minimum spanning tree based on the reduction technique

作者：Ning Aibing^*; Ma Liang; Xiong Xiaohua

来源：Progress in Natural Science:Materials International , 2008, 18(4): 495-499.

DOI：10.1016/j.pnsc.2007.11.014

• degree-constrained minimum spanning tree
• reduction algorithm
• edge exchange technique
• combinatorial optimization

The degree-constrained minimum spanning tree (DCMST) is an NP-hard problem in graph theory. It consists of finding a spanning tree whose vertices should not exceed some given maximum degrees and whose total edge length is minimal. In this paper, novel mathematical properties for DCMST are indicated which lead to a new reduction algorithm that can significantly reduce the size of the problem. Also an algorithm for DCMST to solve the smaller problem is presented which has been preprocessed by reduction algorithm.

• 出版日期2008-4-10
• 单位上海第二工业大学; 上海理工大学