By Topic

Genetic algorithm for node partitioning problem and applications in VLSI design

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
$33 $33
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)
R. Chandrasekharam ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India ; S. Subhramanian ; S. Chaudhury

The group of classical graph-theoretic problems, including graph colouring, clique cover, and maximal clique, may be viewed as instances of a general node partitioning problem (NPP). A wide variety of real life problems can be modelled as instances of NPP. Finding an optimal partition for the NPP is said to be NP-complete. A stochastic search by a genetic algorithm (GA) is employed to find a near optimal solution for the NPP. The critical aspects of the GA for NPP, such as the solution representation by elegant data structure, together with genetic operations and selection policies employed in the GA procedure, are also presented. The proposed GA does not require the number of disjunct node sets to be given a priori. Three application problems in VLSI design are solved as instances of NPP. The experimental results presented in each case of these application problems bring out the efficacy of genetic algorithms.

Published in:

IEE Proceedings E - Computers and Digital Techniques  (Volume:140 ,  Issue: 5 )