A Depth-First Search-Based Algorithm for the Minimization of the Largest Connected Component in Networks
Bildiriler > Tam Metin Bildiri
Yazarlar: Yeşim Aygül, Onur Ugurlu, Urfat NURİYEV
2023 5th International Conference on Problems of Cybernetics and Informatics (PCI), , , Uluslararası, Tam Metin Bildiri, ss 1-4
DOI: 10.1109/pci60110.2023.10326015
Ö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.