Memetic Search for Identifying Critical Nodes in Sparse Graphs
Memetic Search for Identifying Critical Nodes in Sparse Graphs
Critical node problems (CNPs) involve finding a set of critical nodes from a graph whose removal results in optimizing a predefined measure over the residual graph. As useful models for a variety of practical applications, these problems are computationally challenging. In this paper, we study the classic CNP and introduce …