A Simple Genetic Algorithm for the Critical Node Detection Problem (2021)
The critical node detection problem describes a class of graph problems that involves identifying sets of nodes that influence a given graph metric. One variant of this problem is to find the nodes that – when removed from the graph – maximize the number of connected components in the remaining graph. This is an…