Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

We consider the problem of deleting a limited number of nodes from a graph in order to minimize a connectivity measure of the surviving nodes. We prove that the problem isNP-complete even on quite particular types of graphs, and define a dynamic programming recursion that solves the problem in polynomial time when the graph has bounded treewidth. We extend this polynomial algorithm to several variants of the problem.

[1]  Panos M. Pardalos,et al.  Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..

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

[3]  B. Addis,et al.  Removing critical nodes from a graph : complexity results and polynomial algorithms for the case of bounded treewidth , 2011 .

[4]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[5]  Jeroen H. G. C. Rutten,et al.  Disconnecting graphs by removing vertices: a polyhedral approach , 2007 .

[6]  Hans L. Bodlaender,et al.  Some Classes of Graphs with Bounded Treewidth , 1988, Bull. EATCS.

[7]  Edwin D. Mares,et al.  On S , 1994, Stud Logica.

[8]  Taieb Znati,et al.  On Approximation of New Optimization Methods for Assessing Network Vulnerability , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Alexander Grigoriev,et al.  How to Cut a Graph into Many Pieces , 2011, TAMC.

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

[11]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[12]  René Peeters,et al.  The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..

[13]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[14]  Clayton W. Commander,et al.  Identifying Critical Nodes in Protein-Protein Interaction Networks , 2009 .

[15]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[16]  Sy-yen Kuo,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987, IEEE Design & Test of Computers.

[17]  Richard D. Wollmer,et al.  Removing Arcs from a Network , 1964 .

[18]  Panos M. Pardalos,et al.  Cardinality-Constrained Critical Node Detection Problem , 2011 .

[19]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[20]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

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

[22]  Marco Di Summa,et al.  Complexity of the critical node problem over trees , 2011, Comput. Oper. Res..

[23]  J. C. Smith,et al.  Algorithms for discrete and continuous multicommodity flow network interdiction problems , 2007 .

[24]  Jonathan Cole Smith,et al.  Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs , 2012, Networks.

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