An integer programming framework for critical elements detection in graphs

This study presents an integer programming framework for minimizing the connectivity and cohesiveness properties of a given graph by removing nodes and edges subject to a joint budgetary constraint. The connectivity and cohesiveness metrics are assumed to be general functions of sizes of the remaining connected components and node degrees, respectively. We demonstrate that our approach encompasses, as special cases (possibly, under some mild conditions), several other models existing in the literature, including minimization of the total number of connected node pairs, minimization of the largest connected component size, and maximization of the number of connected components. We discuss computational complexity issues, derive linear mixed integer programming (MIP) formulations, and describe additional modeling enhancements aimed at improving the performance of MIP solvers. We also conduct extensive computational experiments with real-life and randomly generated network instances under various settings that reveal interesting insights and demonstrate advantages and limitations of the proposed framework.

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

[2]  Matthias Köppe,et al.  Intermediate integer programming representations using value disjunctions , 2008, Discret. Optim..

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

[4]  Panos M. Pardalos,et al.  Selected Topics in Critical Element Detection , 2012 .

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

[6]  Young-Soo Myung,et al.  A cutting plane algorithm for computing k , 2004, Eur. J. Oper. Res..

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

[8]  Hüseyin Uzunalioglu,et al.  A network survivability model for critical national infrastructures , 2004, Bell Labs Technical Journal.

[9]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[10]  Mario Ventresca,et al.  A derandomized approximation algorithm for the critical node detection problem , 2014, Comput. Oper. Res..

[11]  Nam P. Nguyen,et al.  On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability , 2013, IEEE/ACM Transactions on Networking.

[12]  Marco Di Summa,et al.  Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth , 2013, Discret. Appl. Math..

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

[14]  Alexander Grigoriev,et al.  The Valve Location Problem in Simple Network Topologies , 2008, WG.

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

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

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

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

[19]  Rattikorn Hewett,et al.  Toward identification of key breakers in social cyber-physical networks , 2011, 2011 IEEE International Conference on Systems, Man, and Cybernetics.

[20]  Eduardo L. Pasiliao,et al.  Exact identification of critical nodes in sparse networks via new compact formulations , 2014, Optim. Lett..

[21]  Panos M. Pardalos,et al.  On New Approaches of Assessing Network Vulnerability: Hardness and Approximation , 2012, IEEE/ACM Transactions on Networking.

[22]  Daniel Ortiz Arroyo,et al.  An Information Theory Approach to Identify Sets of Key Players , 2008, EuroISI.

[23]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[24]  Marco Di Summa,et al.  Branch and cut algorithms for detecting critical nodes in undirected graphs , 2012, Computational Optimization and Applications.

[25]  Paul Erdös,et al.  On random graphs, I , 1959 .

[26]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[27]  Randall R. Reeves,et al.  The Bottlenose dolphin , 1990 .

[28]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

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

[30]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[31]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

[33]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[34]  P. Pardalos,et al.  MANAGING NETWORK RISK VIA CRITICAL NODE IDENTIFICATION , 2007 .

[35]  Fan Chung Graham,et al.  The Volume of the Giant Component of a Random Graph with Given Expected Degrees , 2006, SIAM J. Discret. Math..

[36]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[37]  Mario Ventresca,et al.  Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem , 2012, Comput. Oper. Res..

[38]  Jonathan Cole Smith,et al.  Exact interdiction models and algorithms for disconnecting networks via node deletions , 2012, Discret. Optim..