| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1549106 | Progress in Natural Science: Materials International | 2008 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Materials Science
Electronic, Optical and Magnetic Materials
Authors
Aibing Ning, Liang Ma, Xiaohua Xiong,