Abstract
Determining the critical nodes in a network given a certain network measure is a computational challenging problem that requires the design of adaptive and scalable algorithms. The number of connected components in a graph is an example of such a measure: in this case the nodes considered critical are those that, if removed from the network, maximize the number of connected components in the remaining graph. In this paper we approach this problem by using a new algorithm based on Extremal Optimization. Comparisons with existing algorithms conducted on synthetic and real world networks illustrate the potential of the proposed approach.
Citare
@Inproceedings{Gaskó2021CriticalND,
author = {Noémi Gaskó and Tamás Képes and M. Suciu and R. Lung},
booktitle = {Soft Computing Models in Industrial and Environmental Applications},
title = {Critical Node Detection for Maximization of Connected Components: An Extremal Optimization Approach},
year = {2021}
}