Cayley graph isomorphism Cayley图同构
exact graph isomorphism 精确图同构
graph isomorphism problem 图同构问题
graph isomorphism complete 图同构完备
graph isomorphism interactive proof system 图同构的交互式证明系统
graph non-isomorphism 图的非同构
An algorithm for determining graph isomorphism is designed and implemented,whose correctness and validity are tested and verified with some concrete examples.
设计并实现了图同构的一个判定算法,通过实例验证了算法的正确性和有效性。
参考来源 - 求解图同构的判定算法It is avoided the redundancy subgraphs in expansion processing and scanning the entire database. It greatly simplifies the calculation of support degree and improves the query efficiency of graph isomorphism and subgraph isomorphism.
介绍一种三层MADI索引结构，用于存储图集的信息，以减少图集的扫描次数，通过扩展ETree树构造频繁子图，并用表来存储候选子图，避免扩展过程中冗余图的产生以及对整个数据库的扫描，从而简化支持度的计算，提高图/子图同构的查询效率。
参考来源 - 一种新的频繁子图挖掘算法·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
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.
其次，将频繁子图边扩展及同构判断这部分频繁子图挖掘算法中时间复杂度最高的部分并行处理。
应用推荐