PeerJ Computer Science · 2021 · 13 citations · 24 references
ComputingComputer ScienceAlgorithmsComputer NetworksOptimizationEvolutionary ComputationEvolutionary OptimizationGenetic AlgorithmsGraph AlgorithmsNetwork OptimizationNetwork TopologyComplex Network AnalysisComplex Network TheoryDepth-first SearchInitializationMulti-objective Evolutionary AlgorithmsMulti-objective Evolutionary ComputationMulti-objective Evolutionary OptimizationMulti-objective Network Optimization
Determining the critical nodes in a complex network is an essential computation problem. Several variants of this problem have emerged due to its wide applicability in network analysis. In this article we study the bi-objective critical node detection problem (BOCNDP), which is a new variant of the well-known critical node detection problem, optimizing two objectives at the same time: maximizing the number of connected components and minimizing the variance of their cardinalities. Evolutionary multi-objective algorithms (EMOA) are a straightforward choice to solve this type of problem. We propose three different smart initialization strategies which can be incorporated into any EMOA. These initialization strategies take into account the basic properties of the networks. They are based on the highest degree, random walk (RW) and depth-first search. Numerical experiments were conducted on synthetic and real-world network data. The three different initialization types significantly improve the performance of the EMOA.
24
Santo Fortunato · Physics Reports · 2009 · 11.3K citations · Full text
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, Éva Tardos · 2003 · 7.3K citations
K.-I. Goh, Michael E. Cusick, David Valle et al. · Proceedings of the National Academy of Sciences · 2007 · 3.2K citations · Full text