摘要
分析了 Messmer 提出的基于分解的子图同构算法,指出了该算法存在的问题。从分解和组合两个方面对该算法进行了改进。改进的算法不仅解决了原有的问题,而且其性能有所提高。实验结果证明了算法的有效性。
t The algorithm of subgraph isomorphism based on decomposition proposed by Messmer et. is analysed, and its problems are pointed out. A revised algorithm is given, which adapted the decomposition and combination procedure of the original algorithm, and resolve the problems of the original algorithm with higher effeeienee. The experimental result shows that this algorithm is correct.
出处
《计算机科学》
CSCD
北大核心
2006年第1期260-263,共4页
Computer Science
关键词
子图同构
分治法
分解
同构算法
子图
Subgraph isomorphism, Divide and conquer, Decomposition
