By Topic

Genetic-based search for error-correcting graph isomorphism

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)
Yuan-Kai Wang ; Inst. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan ; Kuo-Chin Fan ; Jorng-Tzong Horng

Error-correcting graph isomorphism has been found useful in numerous pattern recognition applications. This paper presents a genetic-based search approach that adopts genetic algorithms as the searching criteria to solve the problem of error-correcting graph isomorphism. By applying genetic algorithms, some local search strategies are amalgamated to improve convergence speed. Besides, a selection operator is proposed to prevent premature convergence. The proposed approach has been implemented to verify its validity. Experimental results reveal the superiority of this new technique than several other well-known algorithms

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:27 ,  Issue: 4 )