Intelligent Information Management

Volume 1, Issue 1 (July 2009)

ISSN Print: 2160-5912   ISSN Online: 2160-5920

Google-based Impact Factor: 1.6  Citations  

The Design of the Minimum Spanning Tree Algorithms

HTML  Download Download as PDF (Size: 466KB)  PP. 56-59  
DOI: 10.4236/iim.2009.11010    7,074 Downloads   11,828 Views  Citations
Author(s)

Affiliation(s)

.

ABSTRACT

Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitness function,operator and few controlling strategies to improve its speed and evolutionary efficiency.Only one solution can be gotten with running traditional al-gorithem atone time.The new algorithm can get a set of the solutions with higher probability in a shorter time.The experiment shows that it has a better performance than traditional methods.

Share and Cite:

Z. LIU and B. JIANG, "The Design of the Minimum Spanning Tree Algorithms," Intelligent Information Management, Vol. 1 No. 1, 2009, pp. 56-59. doi: 10.4236/iim.2009.11010.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.