Detecting critical nodes in sparse graphs

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 NP-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.

[1]  Sergiy Butenko,et al.  Maximum independent set and related problems, with applications , 2003 .

[2]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[5]  Panos M. Pardalos,et al.  Theory and algorithms for cooperative systems , 2004 .

[6]  Sachin B. Patkar,et al.  Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach , 1994, J. Algorithms.

[7]  Valdis E. Krebs,et al.  Uncloaking Terrorist Networks , 2002, First Monday.

[8]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[9]  Alan T. Murray,et al.  Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure , 2010, Comput. Oper. Res..

[10]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

[11]  Myer Kutz,et al.  Handbook of Transportation Engineering , 2003 .

[12]  Reiner Horst,et al.  Introduction to Global Optimization (Nonconvex Optimization and Its Applications) , 2002 .

[13]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[14]  Zhou Tao,et al.  Epidemic dynamics on complex networks , 2006 .

[15]  Panos M. Pardalos,et al.  INTEGER FORMULATIONS FOR THE MESSAGE SCHEDULING PROBLEM ON CONTROLLER AREA NETWORKS , 2004 .

[16]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[17]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[18]  Panos M. Pardalos,et al.  The wireless network jamming problem , 2007, J. Comb. Optim..

[19]  G. Nemhauser,et al.  Integer Programming , 2020 .

[20]  Panos M. Pardalos,et al.  A combinatorial algorithm for message scheduling on controller area networks , 2005 .

[21]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Stephen P. Borgatti.  Identifying sets of key players in a network , 2003, IEMC '03 Proceedings. Managing Technologically Driven Organizations: The Human Side of Innovation and Change (IEEE Cat. No.03CH37502).

[24]  Frederick S. Hillier,et al.  Introduction to Operations Research and Revised CD-ROM 8 , 2005 .

[25]  R. Faure,et al.  Introduction to operations research , 1968 .

[26]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[27]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .