|
|||||
|
|
| 改进的基于分解的子图同构算法 | |
| 引用本文： | 张志祥,李庆华,罗建明.改进的基于分解的子图同构算法[J].计算机科学,2006,33(1):260-263. |
| 作者姓名： | 张志祥 李庆华 罗建明 |
| 作者单位： | 1. 海军工程大学计算机系,武汉,430033;华中科技大学计算机学院,武汉,430070 2. 华中科技大学计算机学院,武汉,430070 3. 海军驻海南地区检修室,三亚,572000 |
| 摘 要： | 分析了Messmer提出的基于分解的子图同构算法，指出了该算法存在的问题。从分解和组合两个方面对该算法进行了改进。改进的算法不仅解决了原有的问题，而且其性能有所提高。实验结果证明了算法的有效性。 |
| 关 键 词： | 子图同构 分治法 分解 |
A Modified Algorithm of Subgraph Isomorphism Based on Decomposition |
|
| ZHANG Zhi-Xiang,LI Qing-Hua,LUO Jian-Ming.A Modified Algorithm of Subgraph Isomorphism Based on Decomposition[J].Computer Science,2006,33(1):260-263. | |
| Authors: | ZHANG Zhi-Xiang LI Qing-Hua LUO Jian-Ming |
| Affiliation: | 1.Department of Computer, Naval University of Engineering, Wuhan 430033;2.School of Computer Science and Technology, Huazhong University of Science and Technology,Wuhan 430070 |
| Abstract: | 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. |
| Keywords: | Subgraph isomorphism Divide and conquer Decomposition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机科学》下载全文 | |