Abstract

In this paper, genetic algorithms are applied to solve the error-correcting subgraph isomorphism (I) problems. The error-correcting subgraph isomorphism problems are first formulated as permutation searching problems. Two ECSl algorithms are devised. The first algorithm implements pure genetic algorithms with permutation representation. The second is a hybrid algorithm that amalgamates assignment algorithms and local search strategy to improve convergence speed. From experiments, the second algorithm shows better performance than the first one and also reveals that the approach is superior to traditional tree search approach

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.