[1] SONMEZ A B, CAN T. Comparison of tissue/disease specific integrated networks using directed graphlet signatures[J]. BMC Bioinformatics, 2017, 18(Suppl. 4):135. [2] 张海威,解晓芳,段媛媛,等.一种基于自适应结构概要的有向标签子图匹配查询算法[J].计算机学报,2017,40(1):52-71. (ZHANG H W, XIE J F, DUAN Y Y, et al.An algorithm for subgraph matching based on adaptive structural summary of labeled directed graph data[J]. Chinese Journal of Computers, 2017, 40(1):52-71.) [3] ULLMANN J R. An algorithm for subgraph isomorphism[J]. Journal of the ACM (JACM), 1976, 23(1):31-42. [4] CORDELLA L P, FOGGIA P, SANSONE C, et al. A (sub)graph isomorphism algorithm for matching large graphs[J]. IEEE Transactions on Pattern Analysis & Machine Intelligence, 2004, 26(10):1367-1372. [5] SUN Z, WANG H, WANG H, et al. Efficient subgraph matching on billion node graphs[J]. Proceedings of the VLDB Endowment, 2012, 5(9):788-799. [6] HAN W-S, LEE J, LEE J-H. TurboISO:towards ultrafast and robust subgraph isomorphism search in large graph databases[C]//SIGMOD'13:Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. New York:ACM, 2013:337-348. [7] REN X, WANG J. Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs[J]. Proceeding of the VLDB Endowment, 2015, 8(5):617-628. [8] BI F, CHANG L, LIN X, et al. Efficient subgraph matching by postponing Cartesian products[C]//SIGMOD'16:Proceedings of the 2016 International Conference on Management of Data. New York:ACM, 2016:1199-1214. [9] HOLDER L B, COOK D, DJOKO S. Substructure discovery in the SUBDUE system[C]//AAAIWS'94:Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining. Seattle, WA:IAAA, 1994:169-180. [10] ZHU F, QU Q, LO D, et al. Mining Top-K large structural patterns in a massive network[J]. Proceedings of the VLDB Endowment, 2011, 4(11):807-818. [11] ZHAO P, HAN J. On graph query optimization in large networks[J]. Proceedings of the VLDB Endowment, 2010, 3(1/2):340-351. [12] HE H, SINGH A K. Query language and access methods for graph databases[M]//Managing and Mining Graph Data. Boston:Springer, 2010:125-160. [13] YAN X, HE B, ZHU F, et al. Top-K aggregation queries over large networks[C]//ICDE 2010:Proceedings of the 2010 IEEE 26th International Conference on Data Engineering. Washington, DC:IEEE Computer Society, 2010:377-380. [14] GUPTA M, GAO J, YAN X, et al. Top-K interesting subgraph discovery in information networks[C]//ICDE 2014:Proceedings of the 2014 IEEE 30th International Conference on Data Engineering. Washington, DC:IEEE Computer Society, 2014:820-831. [15] SUN Y, YU Y, HAN J. Ranking-based clustering of heterogeneous information networks with star network schema[C]//KDD'09:Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2009:797-806. [16] CHAKRABARTI D, ZHAN Y, FALOUTSOS C. R-MAT:a recursive model for graph mining[C]//SIAM International Conference on Data Mining. Philadelphia, PA:Society for Industrial and Applied Mathematics (SIAM), 2004:442-446. |