The path layer matrix is closely related to graphisomorphism.
图的路径层矩阵与图的同构问题密切相关。
2
A novel method, the circuit simulation algorithm, is proposed here, which transfers the graphisomorphism problem into the identical circuits problem.
提出了一种新的同构判定算法：电路模拟法，即将图的同构问题转化为电路的相同问题。
3
Secondly, we processed the edge expansion and frequent sub-graphisomorphism which are the most complexity parts of frequent subgraphs mining in parallel.