Optimal attack strategy of complex networks based on tabu search

DOI10.1016/j.physa.2015.08.043zbMath1400.94203OpenAlexW1429530505MaRDI QIDQ1618887

Yue-jin Tan, Ye Deng, Jun Wu

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.08.043

zbMATH Keywords

tabu searchcomplex networksnetwork disintegrationoptimal attack strategy

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30)

Related Items

Efficient disintegration strategy in directed networks based on tabu search ⋮ Finding key node sets in complex networks based on improved discrete fireworks algorithm ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic ⋮ Attack and defense strategies in complex networks based on game theory

Cites Work

• A faster algorithm for betweenness centrality*
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Vulnerability of complex networks under intentional attack with incomplete information
• Tabu Search—Part I
• Tabu Search—Part II
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• Unnamed Item
• Unnamed Item