A Fast Greedy Algorithm for the Critical Node Detection Problem

Abstract

The critical node detection problem (CNDP) aims to fragment a graph \(G=(V,E)\) by removing a set of vertices \(R\) with cardinality \(|R|\le K\) such that the residual graph has minimum pairwise connectivity. Algorithms that are capable of finding \(R\) in graphs with many thousands or millions of vertices are needed since existing approaches require significant computational cost and subsequently are useful for only very small network instances. An efficient method for evaluating the impact of removing any \(v \in V\) on the CNDP objective function within reasonable time and space complexity is then necessary. In this paper we propose a depth-first search solution to this problem that requires \(\mathcal {O}(|V|+|E|)\) complexity, and employ the method in a greedy algorithm for quickly identifying \(R\) in large networks. We evaluate the results using six real-world benchmark problems. The proposed algorithm can be easily extended to vertex and edge-weighted variants of the critical vertex detection problem.