[1] 杜瑞芝. 数学史辞典[M]. 济南: 山东教育出版社, 2017: 739-741. Du Ruizhi.Dictionary of Mathematical History [M]. Ji'nan: Shandong Education Press, 2017: 739-741. [2] 周晓清, 叶安胜, 张志强. 无向图中连通支配集问题的精确算法[J]. 计算机应用研究, 2019, 36(9): 2569-2574. Zhou Xiaoqing, Ye Ansheng, Zhang Zhiqiang.Exact Algorithm for Connected Dominating Set in Undirected Graphs[J]. Journal of Computer Application Research, 2019, 36(9): 2569-2574. [3] 胡国定. 简明数学词典[M]. 北京: 科学出版社, 2007: 504-507. Hu Guoding.Concise Dictionary of Mathematics [M]. Beijing: Science Press, 2007: 504-507. [4] 谭屯子, 高随祥, 杨文国. 判断一个无向图是否连通图的方法[J]. 中国科学院大学学报, 2018, 35(5): 582-588. Tan Tunzi, Gao Suixiang, Yang Wenguo.Determining the Connectedness of an Undirected Graph[J]. Journal of University of Chinese Academy of Sciences, 2018, 35(5): 582-588. [5] 黄炎孙. 人工智能的符号主义立场研究——从图灵测试谈起[D]. 北京: 北京化工大学, 2014. Huang Yansun.Research on Semioticism of Artificial Intelligence—from Turing Test [D]. Beijing: Beijing University of Chemical Technology, 2014. [6] 杭慧喆. 摩尔论“图灵测试”[D]. 武汉: 华中科技大学, 2016. Hang Huizhe.Moore on "Turing test" [D]. Wuhan: Huazhong University of Science and Technology, 2016. [7] 胡嵩. 图灵的机器思维思想初探[D]. 武汉: 华中师范大学, 2017. Hu Song.A Preliminary Study on Turing's Machine Thinking [D]. Wuhan: Central China Normal University, 2017. [8] 刘夫云. 复杂网络中的完全子图搜索算法研究[J]. 仪器仪表学报, 2006, 27(增1): 937-939. Liu Fuyun.Algorithm for Detecting Complete Sub-graph Incomplex Network[J]. Chinese Journal of Scientific Instrument , 2006, 27(S1): 937-939. [9] 张野. 一个复杂网络中完全子图的搜索算法[J]. 数学理论与应用, 2013, 33(3): 74-77. Zhang Ye.An Algorithm for Detecting Complete Sub-graphs in Complex Networks[J]. Mathematical Theory and Applications, 2013, 33(3): 74-77. [10] 冯磊, 查亚兵, 胡记文, 等. 基于复杂网络的作战模拟组织建模研究[J]. 系统仿真学报, 2012, 24(4): 146-150. Feng Lei, Zha Yabing, Hu Jiwen, et al.Research of Combat Simulation Organization Modeling Based on Complex Networks[J]. Journal of Systems Simulation, 2012, 24(4): 146-150. |