An Algorithm for Inexact Graph Matching Based on Genetic Method

摘要

An algorithm for inexact graph matching based on genetic method is proposed in this paper. It has some prominent merits such as inexact graph matching, fast speed, insensitive to the noises and low order computational complexity. This algorithm can be applied to many fields such as sub-graph isomorphism, weighted graph matching and attributed relational graph matching. The experimental results indicate the effectiveness and adaptability of the new algorithm.