Affordable Access

Publisher Website

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

Authors
Journal
Progress in Natural Science Materials International
1002-0071
Publisher
Elsevier
Publication Date
Volume
18
Issue
4
Identifiers
DOI: 10.1016/j.pnsc.2007.11.014
Keywords
  • Degree-Constrained Minimum Spanning Tree
  • Reduction Algorithm
  • Edge Exchange Technique
  • Combinatorial Optimization
Disciplines
  • Computer Science
  • Mathematics

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.