Cart (Loading....) | Create Account
Close category search window
 

Designing regular graphs with the use of evolutionary algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sawionek, B. ; Inst. of Radioelectron., Warsaw, Poland ; Wojciechowski, J. ; Arabas, J.

The paper deals with a fundamental problem arising in the design of optimal networks-the maximization of the number of spanning trees. To make the problem computationally tractable, we consider a class of regular graphs. The problem is solved with the use of the evolutionary algorithm and compared to the 2-opt method. The problem-specific genetic operators are introduced, Various experiments with different graph structures have been performed, the results are reported and discussed. The influence of introducing some preliminary knowledge about the problem on the algorithm effectiveness is studied

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference:

1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.