Title: Some Tree Representations for Solving the Degree Constrained Minimum Spanning Tree Problems
Abstract:To solve the Degree Constrained Minimum Spanning Tree (DCMST) Problem using computer we need to represent the tree in the most efficient way in order to reduce the processing time, especially the init...To solve the Degree Constrained Minimum Spanning Tree (DCMST) Problem using computer we need to represent the tree in the most efficient way in order to reduce the processing time, especially the initialization process. The DCMST Problem is concerned with finding, in a given edge weighted graph G (all weights are nonnegative), the minimum weight spanning tree T satisfying specified degree restrictions on the vertices. This problem arises naturally in communication networks where the degree of a vertex represents the number of line interfaces available at a terminal (center). In this paper we will discuss some tree representations that can be used for solving the DCMST Problem. Keywords: Minimum spanning tree, degree constrained, tree representation.Read More
Publication Year: 2012
Publication Date: 2012-02-29
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot