Scalable and Adaptive Algorithms for the Triangle Interdiction Problem on Billion-Scale Networks

Motivated by the relevance of clustering or transitivity to a variety of network applications, we study the Triangle Interdiction Problem (TIP), which is to find a minimum-size set of edges that intersects all triangles of a network. As existing approximation algorithms for this NP-hard problem either do not scale well to massive networks or have poor solution quality, we formulate two algorithms, TARL and DART, with worst-case guarantees 5/2 and 3 with respect to optimal, respectively. Furthermore, DART is able to efficiently maintain its worst-case guarantee under dynamic edge insertion and removal to the network. In our comprehensive experimental evaluation, we demonstrate that DART is able to run on networks with billions of triangles within 2 hours and is able to dynamically update its solution in microseconds.

[1]  Charalampos E. Tsourakakis.  Fast Counting of Triangles in Large Real Networks : Algorithms and Laws , 2008 .

[2]  Damon Centola,et al.  The Spread of Behavior in an Online Social Network Experiment , 2010, Science.

[3]  Michael Krivelevich,et al.  On a conjecture of Tuza about packing and covering of triangles , 1995, Discret. Math..

[4]  Dorothea Wagner,et al.  Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study , 2005, WEA.

[5]  Jure Leskovec,et al.  The bursty dynamics of the Twitter information network , 2014, WWW.

[6]  Nam P. Nguyen,et al.  Dynamic Social Community Detection and Its Applications , 2014, PloS one.

[7]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[8]  Venkatesan Guruswami,et al.  Inapproximability of Feedback Vertex Set for Bounded Length Cycles , 2014, Electron. Colloquium Comput. Complex..

[9]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[10]  Nam P. Nguyen,et al.  Transitivity Demolition and the Falls of Social Networks , 2017, ArXiv.

[11]  Dengfeng Sun,et al.  Weighted clustering coefficient maximization for air transportation networks , 2013, 2013 European Control Conference (ECC).

[12]  Nam P. Nguyen,et al.  Vulnerability of clustering under node failure in complex networks , 2017, Social Network Analysis and Mining.

[13]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[14]  Michael Langberg,et al.  Approximating Maximum Subgraphs without Short Cycles , 2008, SIAM J. Discret. Math..

[15]  Alan T. Murray,et al.  Comparative Approaches for Assessing Network Vulnerability , 2008 .

[16]  Ge Xia,et al.  On the small cycle transversal of planar graphs , 2011, Theor. Comput. Sci..

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

[18]  Dmitri Loguinov,et al.  On Efficient External-Memory Triangle Listing , 2019, IEEE Transactions on Knowledge and Data Engineering.