Journal Homepage: www.ijcst.org

Abstract—Graph matching is used for model-based pattern recognition of brain images, model design objects in a computer-aided design, machine learning, data mining, packet filtering, web phishing, etc. In this paper, we have proposed a new genetic algorithm for inextract graph matching with many types of graph such as undirected, directed, weighted, and labeled. The experimental results show that our proposed algorithm has achieved a much better performance than other deterministic algorithms