[1] AGGARWAL C C, WANG H. Managing and mining graph data [M]. Berlin: Springer, 2010: 1-606.[2] SAKR S, AL-NAYMAT G. Graph indexing and querying: a review [J]. International Journal of Web Information Systems, 2010, 6(2): 101-120.[3] 赵彩虹.基于DBLP的作者协作关系挖掘[D].哈尔滨:黑龙江大学,2010.[4] YAN XIFENG, YU P S, HAN J. Substructure similarity search in graph databases [C]// SIGMOD'05: Proceedings of the ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 2005: 766-777.[5] ULLMANN J R. An algorithm for subgraph isomorphism [J]. Journal of the ACM, 1976, 23(1): 31-42.[6] CORDELLA L P, FOGGIA P, SANSONE C, et al. A (sub)graph isomorphism algorithm for matching large graphs [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(10): 1367-1372.[7] 张硕,李建中,高宏,等.一种多到一子图同构检测方法[J].软件学报,2010,21(3):401-414.[8] SHASHA D, WANG J T L, GIUGNO R. Algorithmics and applications of tree and graph searching [C]// PODS'02: Proceedings of the 21st ACM Symposium on Principles of Database Systems. New York: ACM Press, 2002: 39-52.[9] TIAN Y, PATEL J M. Tale: A tool for approximate large graph matching [C]// ICDE'08: Proceedings of the 24th IEEE International Conference on Data Engineering. Washington, DC: IEEE Computer Society, 2008: 963-972.[10] ZHANG SHIJIE, YANG JIONG, JIN WEI. SAPPER: Subgraph indexing and approximate matching in large graphs [C]// VLDB'2010: Proceedings of the 36th International Conference on Very Large Databases. Singapore: VLDB Endowment, 2010: 1185-1194.[11] ZHU L, NG W K, CHENG J. Structure and attribute index for approximate graph matching in large graphs [J]. Information Systems, 2011, 36(6): 958-972.[12] DURUGBO C, HUTABARAT W, TIWARI A, et al. Modelling collaboration using complex networks [J]. Information Sciences, 2011, 181(15): 3143-3161. |