摘要
最短路径问题是求解复杂网络关键节点的关键,也是优化问题中的一个研究热点。在多层复杂网络模型生成的基础上,基于Floyd算法,结合节点在整个网络中全局最优和局部最优两个方面,提出了一种关键节点评价的新算法。通过实验结果与已有的研究结果的对比,证明了新提出的Floyd改进加速算法能够大大减少计算量,对于常见的大规模的无向无权复杂网络模型可以获得很好的计算能力,达到了较好的仿真效果,为多层系统复杂网络的研究提供了新的理论基础和一定的参考价值。
The shortest path problem is the key in solving the key nodes of complex networks and is also a research hotspot in optimization prob- lem. On the basis of muhilayer complex network model generation, a new algorithm for key node evaluation is proposed based on Floyd algo- rithm and the global and local optimal of nodes in the whole network. Through the comparison between the experimental results and the existing research results, it is proved that the proposed Floyd improved acceleration algorithm can greatly reduce the computation amount. For the common large-scale undirected and unweighted network model, it can get a good computing ability, and achieve a good simulation effect. It provides a new theoretical basis and a certain reference value for the research of muhilayer complex network.
作者
马莹
陈志龙
刘贺
赵铜星
Ma Ying 1,Chen Zhilong 1, Liu He2 , Zhao Tongxing3(1. College of Defence Engineering, PLA Army Engineering University, Nanjing 210007, China;2. Voice of the Strait Fuzhou, 350000, China;3. College of Field Engineering, PLA University of Science and Technology, Nanjing 210007, Chin)
出处
《信息技术与网络安全》
2018年第6期72-75,107,共5页
Information Technology and Network Security
基金
国家自然科学基金(51478463)
关键词
多层复杂网络
最短路径问题
改进的Floyd加速算法
multilayer complex networks
the shortest path problem
improved Floyd accelerating algorithm
