Detecting critical nodes in sparse graphs

Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos

Research output: Contribution to journalArticle

197 Citations (Scopus)

Abstract

Identifying critical nodes in a graph is important to understand the structural characteristics and the connectivity properties of the network. In this paper, we focus on detecting critical nodes, or nodes whose deletion results in the minimum pair-wise connectivity among the remaining nodes. This problem, known as the critical node problem has applications in several fields including biomedicine, telecommunications, and military strategic planning. We show that the recognition version of the problem is NPNP-complete and derive a mathematical formulation based on integer linear programming. In addition, we propose a heuristic for the problem which exploits the combinatorial structure of the graph. The heuristic is then enhanced by the application of a local improvement method. A computational study is presented in which we apply the integer programming formulation and the heuristic to real and randomly generated data sets. For all instances tested, the heuristic is able to efficiently provide optimal solutions in a fraction of the time required by a commercial software package.
Original languageEnglish
Pages (from-to)2193-2200
Number of pages8
JournalComputers & Operations Research
Volume36
Issue number7
DOIs
Publication statusPublished - Jul 2009
Externally publishedYes

Keywords

  • critical node detection
  • heuristics
  • integer linear programming

Fingerprint Dive into the research topics of 'Detecting critical nodes in sparse graphs'. Together they form a unique fingerprint.

Cite this