Title: Research on Algorithms for Minimum Cost Spanning Trees
Abstract:The minimum spanning tree problem is a classic combinatorial optimization problem and there exist many efficient algorithms to solve it.But in real network,the vertices as well as the edges may have c...The minimum spanning tree problem is a classic combinatorial optimization problem and there exist many efficient algorithms to solve it.But in real network,the vertices as well as the edges may have costs,and there are many cases of the vertex weights.The minimum cost spanning tree problem with practical application background is studied in this paper.And some valuable properties and methods are presented for several kinds of minimum cost spanning tree problem based on different values of the vertex weights.Read More
Publication Year: 2010
Publication Date: 2010-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot