|
[1]
|
[美]欧内斯特∙博耶. 学术水平的反思-教授工作的重点领域[M]//吕达, 周满生. 当代外国教育改革著名文献(美国卷∙第三册). 北京: 人民教育出版社, 2004: 23.
|
|
[2]
|
王本陆. 课程与教学论[M]. 北京: 高等教育出版社, 2017: 259.
|
|
[3]
|
邱菀华, 冯允成, 魏法杰, 周泓, 刘美芳. 运筹学教程[M]. 北京: 机械工业出版社, 2009.
|
|
[4]
|
汪小帆, 李翔, 陈关荣. 网络科学导论[M]. 北京: 高等教育出版社, 2012.
|
|
[5]
|
Strogatz, S.H. (2001) Exploring Complex Networks. Nature, 410, 268-276. [Google Scholar] [CrossRef] [PubMed]
|
|
[6]
|
百度百科. 复杂网络[EB/OL]. https://baike.baidu.com/item/复杂网络, 2024-04-23.
|
|
[7]
|
维基百科[EB/OL]. https://www.wikipedia.org/, 2024-04-23.
|
|
[8]
|
Rossi, R.A. and Ahmed, N.K. (2014) Network Repository: A Graph Data Repository with Visual Interactive Analytics. arXiv: 1410.3560
|
|
[9]
|
马良. 基础运筹学教程[M]. 北京: 高等教育出版社, 2014.
|
|
[10]
|
Nicosia, G. and Oriolo, G. (2003) An Approximate A* Algorithm and Its Application to the SCS Problem. Theoretical Computer Science, 290, 2021-2029. [Google Scholar] [CrossRef]
|
|
[11]
|
王小娟. 超大规模图的最短路径距离近似算法[D]: [硕士学位论文]. 扬州: 扬州大学, 2016.
|
|
[12]
|
唐晋韬, 王挺, 王戟. 适合复杂网络分析的最短路径近似算法[J]. 软件学报, 2011, 22(10): 2279-2290.
|
|
[13]
|
Tretyakov, K. and Armas-Cervantes, A. (2014) Fast Fully Dynamic Landmark-Based Estimation of Shortest Path Distances in Very Large Graphs. Proceedings of CIKM' 11, Glasgow Scotland, 24-28 October 2011, 1785-1794. [Google Scholar] [CrossRef]
|
|
[14]
|
Adamic L.A., Lukose R.M., Puniyani A.R., et al. (2001) Search in Power-Law Networks. Physical Review E, 64, 234-241. [Google Scholar] [CrossRef]
|
|
[15]
|
Kim, B.J., Yoon, C.N., Han, S.K., et al. (2002) Path Finding Strategies in Scale-Free Networks. Physical Review E, 65, 27-43. [Google Scholar] [CrossRef]
|
|
[16]
|
张昕, 严沛, 郭阳, 王慧慧. 基于k-shell的复杂网络最短路径近似算法[J]. 计算机工程与应用, 2019, 55(14): 54-60. [Google Scholar] [CrossRef]
|