期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Identification of key recovering node for spatial networks
1
作者 严子健 夏永祥 +3 位作者 郭丽君 祝令哲 梁圆圆 涂海程 《Chinese Physics B》 SCIE EI CAS CSCD 2023年第6期698-704,共7页
Many networks in the real world have spatial attributes, such as location of nodes and length of edges, called spatial networks. When these networks are subject to some random or deliberate attacks, some nodes in the ... Many networks in the real world have spatial attributes, such as location of nodes and length of edges, called spatial networks. When these networks are subject to some random or deliberate attacks, some nodes in the network fail, which causes a decline in the network performance. In order to make the network run normally, some of the failed nodes must be recovered. In the case of limited recovery resources, an effective key node identification method can find the key recovering node in the failed nodes, by which the network performance can be recovered most of the failed nodes. We propose two key recovering node identification methods for spatial networks, which are the Euclidean-distance recovery method and the route-length recovery method. Simulations on homogeneous and heterogeneous spatial networks show that the proposed methods can significantly recover the network performance. 展开更多
关键词 complex networks spatial networks CONGESTION key recovering node
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部