频繁子图挖掘主要涉及到子图搜索和子图同构问题。
Frequent subgraph mining includes subgraph search and isomorphism problems.
图同构的判定性问题是图论理论中的一个难题，至今没有得到彻底解决。
How to determine the isomorphism of graphs is a difficult problem of graph theory, which has not been completely solved so far.
通过逐一考查全体特征值，实现图同构的判定并确定同构图的顶点对应关系。
After all the eigenvalues have been considered, isomorphism will be determined and correspondence of vertices in isomorphic graphs can be ultimately identified.
设计并实现了图同构的一个判定算法，通过实例验证了算法的正确性和有效性。
An algorithm for determining graph isomorphism is designed and implemented, whose correctness and validity are tested and verified with some concrete examples.
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
One helpful way to determine the isomorphism of graphs is to use elementary operations on a graph adjacency matrix so as to transform one matrix into another.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
应用推荐