期刊
RELIABILITY ENGINEERING & SYSTEM SAFETY
卷 183, 期 -, 页码 276-280出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.ress.2018.11.020
关键词
Robustness; Complex networks; Optimization; MILP
资金
- Spanish Ministry of economy and competitiveness [MTM2015-63779-R]
Finding the most critical nodes regarding network connectivity has attracted the attention of many researchers in infrastructure networks, power grids, transportation networks and physics in complex networks. Static robustness of networks under intentional attacks analyses the ability of a system to maintain its connectivity after the disconnection or deletion of a series of targeted nodes. In this context, connectivity is typically measured by the size of the remaining largest connected component. When targeting these nodes, previous literature has mostly used adaptive strategies that sequentially remove central nodes, or created heuristics in order to improve the results of the adaptive strategies. The proposed methodology based on mathematical programming allows to identify, for every fraction of disconnected or removed nodes, the set that minimizes the size of the largest connected component of a network, i.e. it allows to calculate the exact (most critical) robustness of a network.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据