The path layer matrix is closely related to graph isomorphism.

图的路径层矩阵与图的同构问题密切相关。

A novel method, the circuit simulation algorithm, is proposed here, which transfers the graph isomorphism problem into the identical circuits problem.

提出了一种新的同构判定算法：电路模拟法，即将图的同构问题转化为电路的相同问题。

Secondly, we processed the edge expansion and frequent sub-graph isomorphism which are the most complexity parts of frequent subgraphs mining in parallel.

其次，将频繁子图边扩展及同构判断这部分频繁子图挖掘算法中时间复杂度最高的部分并行处理。

An algorithm for determining graph isomorphism is designed and implemented, whose correctness and validity are tested and verified with some concrete examples.

设计并实现了图同构的一个判定算法，通过实例验证了算法的正确性和有效性。

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。