Abstract
A solution of NP-hard optimization problem of constructing optimal circulant networks with the minimum diameter for given degree d > 4 and number of graph nodes N >1000 is considered. The circulant networks and their different applications are the object of intensive in- vestigations, and they are realized as interconnection networks in some parallel multicomputer systems. The application to solution of the problem of a genetic algorithm based on the simulation of natural evolution process and the comparison between it and a random and reduced se- arch algorithms are considered. The catalogues of optimal (suboptimal) circulant networks are obtained.
Author supplied keywords
Cite
CITATION STYLE
Monakhova, E. A., Monakhov, O. G., & Mukhoed, E. V. (1999). Genetic construction of optimal circulant network designs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1596, pp. 215–223). Springer Verlag. https://doi.org/10.1007/10704703_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
