一种多到一子图同构检测方法课件.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.3, March 2010, pp.401−414 doi: 10.3724/SP.J.1001.2010.03478 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 一种多到一子图同构检测方法 + 张 硕 , 李建中, 高 宏, 邹兆年 (哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001) Approach for Efficient Subgraph Isomorphism Testing for Multiple Graphs + ZHANG Shuo , LI Jian-Zhong, GAO Hong, ZOU Zhao-Nian (School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) + Corresponding author: E-mail: zhangshuocn@ Zhang S, Li JZ, Gao H, Zou ZN. Approach for efficient subgraph isomorphism testing for multiple graphs. Journal of Software, 2010,21(3):401−414. /1000-9825/3478.htm Abstract : This paper proposes an approach for subgraph isomorphism testing from a set of priori given small graphs to a large graph issued on-line. In order to reduce the computational cost, based on DFS Code, an elaborate organization of a set of graphs is presented, and a look-ahead-pruning based algorithm of subgraph isomorphism testing from multiple small graphs to a large graph is proposed. Moreover, an index technique based on data mining is introduced. Analytical and experimental results show the on-line computational cost of the proposed method is much less than the state-of-the-art method and it is about one order of magnitude faster than the existing method with more than one order of magnitude less off-line construction time. Key words: graph matching; subgraph isomorphism; preprocessing; graph indexing 摘 要: 提出一种方法来解决从多个小图到一个大图的子图同构检测问题,其中多个小图是预先给定的,而大图 是用户在线提交的