1,507
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

A heuristic approach for the distance-based critical node detection problem in complex networks

ORCID Icon, , ORCID Icon &
Pages 1347-1361 | Received 15 Aug 2020, Accepted 29 Mar 2021, Published online: 26 May 2021

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Qing Zhou, Jin-Kao Hao, Zhong-Zhong Jiang & Qinghua Wu. (2024) An effective hybrid search method for the quadratic knapsack problem with conflict graphs. Journal of the Operational Research Society 75:5, pages 1000-1010.
Read now

Articles from other publishers (5)

Essia Hamouda, Mohsen ElHafsi & Joon Son. (2024) Securing Network Resilience: Leveraging Node Centrality for Cyberattack Mitigation and Robustness Enhancement. Information Systems Frontiers.
Crossref
Essia Hamouda, Mohsen Elhafsi & Joon Son. (2024) Securing Network Resilience Leveraging Node Centrality for Cyberattack Mitigation and Robustness Enhancement. SSRN Electronic Journal.
Crossref
Essia Hamouda. 2024. Dynamics of Information Systems. Dynamics of Information Systems 116 130 .
Chanjuan Liu, Shike Ge & Yuanke Zhang. (2023) Identifying the cardinality-constrained critical nodes with a hybrid evolutionary algorithm. Information Sciences 642, pages 119140.
Crossref
Yangming Zhou, Gezi Wang, Jin-Kao Hao, Na Geng & Zhibin Jiang. (2023) A fast tri-individual memetic search approach for the distance-based critical node problem. European Journal of Operational Research 308:2, pages 540-554.
Crossref