Determining whether two graphs are isomorphic is referred to as the graph isomorphism problem. 确定是否是同构的两个图形称为图同构问题。
The algorithm transforms the subgraph isomorphism problem into a matching problem between vertexes through the introduction of similarity features for every vertex. 通过单个顶点的相似度特征,将子图同构问题转化为顶点之间的匹配问题。