频繁子图挖掘主要涉及到子图搜索和子图同构问题。
Frequent subgraph mining includes subgraph search and isomorphism problems.
阐述了算法的理论原理及计算步骤，并给出了冗余节点、子图同构的判断方法和简化规则算例验证了本理论的正确性和适应性。
The judgment principles and reduction rules about redundant nodes and isomorphic graphs are presented. The examples given show correctness and applicability of the algorithm.
阐述了算法的理论原理及计算步骤，并给出了冗余节点、子图同构的判断方法和简化规则算例验证了本理论的正确性和适应性。
The judgment principles and reduction rules about redundant nodes and isomorphic graphs are presented. The examples given show correctness and applicability of the algorithm.
应用推荐