A Depth-First Search-Based Algorithm for the Minimization of the Largest Connected Component in Networks
Yükleniyor...
Dosyalar
Tarih
2023
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Institute of Electrical and Electronics Engineers Inc.
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Identifying critical nodes is essential as it can significantly enhance network resilience and minimize the impact of failures or attacks. This problem finds applications in various domains, including communication networks, power grids, transportation networks, and social networks. In this study, we focus on a well-known critical node problem that aims to minimize the size of the largest connected component in the residual network and propose a new algorithm based on the depth-first search (DFS) tree. To evaluate the performance of the proposed algorithm, we conducted extensive experiments on benchmark datasets, including synthetic and real-world networks, and compared the results with the centrality measure. The simulation results demonstrate the effectiveness of our proposed algorithm in detecting critical nodes in networks. © 2023 IEEE.
Açıklama
5th International Conference on Problems of Cybernetics and Informatics, PCI 2023 -- 28 August 2023 through 30 August 2023 -- -- 195003
Anahtar Kelimeler
centrality measures; critical nodes; network analysis; optimization, Benchmarking; Centrality measures; Communications networks; Critical node; Depth first; In networks; Largest connected component; Minimisation; Network resilience; Optimisations; Search-based algorithms; Trees (mathematics)
