Title: Minimum spanning tree algorithm confined in conditions
Abstract:The traditional algorithm of minimum spanning tree algorithm is invalidation facing the minimum spanning tree question confined in degree,the minimum spanning tree question in dynamic condition and th...The traditional algorithm of minimum spanning tree algorithm is invalidation facing the minimum spanning tree question confined in degree,the minimum spanning tree question in dynamic condition and the minimum spanning tree question confined in edge set,in practice.Genetic algorithm can solve the minimum spanning tree confined in degree,but it take on poor efficiency and complex coding.The models of the minimum spanning tree algorithm confined in conditions are generated.The three minimum spanning tree algorithms confined in conditions is put forward based on traditional algorithm.The algorithms are validated and compared,and show the minimum spanning tree algorithm confined in conditions is completely feasible and effective.Read More
Publication Year: 2008
Publication Date: 2008-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