Abstract
Network disintegration comprises the problem of identifying the critical nodes or edges whose removal will lead to a network collapse. The solution of this problem is significant for strategies for dismantling terrorist organizations and for immunization in disease spreading. Network disintegration has received considerable attention in isolated networks. Here, we consider the generalization of optimal disintegration strategy problems to multiplex networks and propose a disintegration strategy based on tabu search. Experiments show that the disintegration effect of our strategy is clearly superior to those of typical disintegration strategies. Moreover, our approach sheds light on the properties of the nodes within the optimal disintegration strategies.
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 callMore From: Chaos: An Interdisciplinary Journal of Nonlinear Science
Disclaimer: 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.
