Abstract
The problem of network disintegration, such as suppressing the epidemic spreading and destabilizing terrorist networks, has broad applications and recently has attracted more attentions. The fundamental purpose of this study is to find the critical nodes whose deficiency could lead to the network collapse. By now, most related works of attack strategy in complex networks use certain properties of the nodes, while little is known about optimal attack strategy for complex networks. In this paper, we presented an optimized attack strategy model for complex networks and introduced the tabu search into the problem. The network performance is quantitatively measured by natural connectivity, which can be used to effectively characterize the robustness of complex networks. Numerical experiments suggest that our solution can identify the 'best' choice for node failure attack.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
