[1]ZHANG T. Electronic government network structure and security management[D]. Nanjing: Nanjing University of Posts and Telecommunications, 2012.(张庭. 电子政务外网网络结构与安全管理[D]. 南京: 南京邮电大学, 2012.)
[2]LU W, LI X, DAN Q. Infosec system constuction for e-government network[J]. Information Security and Communications Privacy, 2012(9): 78-80.(卢文, 李熊达, 但强. 电子政务网络中的信息安全体系建设[J]. 信息安全与通信保密, 2012(9): 78-80.)
[3]GB/Z 24294 — 2009. Guide of implementation for Internet-based e-government information security[S/OL].[2010-02-01]. http://wenku.baidu.com/view/6f442635f111f18583d05afa.html.(GB/Z 24294 — 2009. 基于互联网电子政务信息安全实施指南[S/OL].[2010-02-01]. http://wenku.baidu.com/view/6f442635f111f18583d05afa.html)
[4]ZHANG F, FENG B. Vulnerability assessment based on correlation[J]. Application Research of Computers, 2013, 31(3): 811-814.(张凤荔, 冯波. 基于关联性的漏洞评估方法[J]. 计算机应用研究, 2013, 31(3): 811-814.)
[5]NI P, WU Z. Research on analysis methods of network vulnerability[J]. Computer Technology and Development, 2013, 23(4): 126-130.(倪评福, 吴作顺. 网络脆弱性分析方法的研究[J]. 计算机技术与发展, 2013, 23(4): 126-130.)
[6]CONTE D, FOGGIA P, SANSONE C, et al. Thirty years of graph matching in pattern recognition[J]. International Journal of Pattern Recognition and Artificial Intelligence, 2004, 18(3): 265-298.
[7]KOLLIAS G, SATHE M, SCHENK O, et al. Fast parallel algorithms for graph similarity and matching[J]. Journal of Parallel and Distributed Computing, 2012, 3(1): 1161-1172.
[8]ULLMANN J R. An algorithm for subgraph isomorphism[J]. Journal of the ACM, 1976, 23(1): 31-42.
[9]GUO X, GAO L, CHEN X. Models and algorithms for alignment of biological networks[J]. Journal of Software, 2010, 21(9): 2089-2106.(郭杏莉, 高琳, 陈新. 生物网络比对的模型与算法[J]. 软件学报, 2010, 21(9): 2089-2106.)
[10]LIANG Z, XU M, TENG M, et al. Comparison of protein interaction networks reveals species conservation and divergence[J]. BMC Bioinformatics, 2006,7(1): 457-472.
[11]TIAN W, SAMATOVA N F. Pairwise alignment of interaction networks by fast identification of maximal conserved patterns[J]. Pacific Symposium on Biocomputing, 2009, 14: 99-110.
[12]ZHU L, KEONG N W, CHENG J. Structure and attribute index for approximate graph matching in large graphs[J]. Information Systems, 2011, 36(6): 958-972.
[13]BUNKE H. Graph matching: Theoretical foundations, algorithms and applications[C]// Proceedings of Vision Interface, Montreal. Berlin: Springer, 2000: 82-83.
[14]KHAN A, LI N, YAN X, et al. Neighborhood based fast graph search in large networks[C]// Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data. New York: ACM, 2011: 901-912.
[15]FAN W, LI J, MA S, et al. Graph homomorphism revisited for graph matching[J]. Proceedings of the VLDB Endowment,2010,3(2): 1161-1172.
[16]HUANG Y, HONG J, QIN Z. Approximate subgraph matching based on dual index[J]. Journal of Computer Applications, 2012, 32(7): 1994-1997.(黄云, 洪佳明, 覃遵跃. 基于双索引的近似子图匹配[J]. 计算机应用, 2012, 32(7): 1994-1997.)〖HJ1.5mm〗
[17]PANG J, GU Y, XU J, et al. Research advance on similarity join queries[J]. Journal of Frontiers of Computer Science, 2013, 7(1): 1-13.(庞俊, 谷峪, 许嘉, 等. 相似性连接查询技术研究进展[J]. 计算机科学与探索, 2013,7(1): 1-13.)
[18]NARAYANAN M, KARP R M. Comparing protein interaction networks via a graph match-and-split algorithm[J]. Journal of Computational Biology, 2007, 14(7): 892-907. |