Incremental Strong Connectivity and 2-Connectivity in Directed Graphs

In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of those cuts. We give a conditional lower bound that provides evidence that our algorithms may be tight up to sub-polynomial factors. As an additional result, with our approach we can also maintain dynamically the $2$-vertex-connected components of a digraph during any sequence of edge insertions in a total of $O(mn)$ time. This matches the bounds for the incremental maintenance of the $2$-edge-connected components of a digraph.

[1]  Giuseppe F. Italiano,et al.  Finding strong bridges and strong articulation points in linear time , 2012, Theor. Comput. Sci..

[2]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[3]  Mario Ventresca,et al.  Efficiently identifying critical nodes in large complex networks , 2015 .

[4]  Giuseppe F. Italiano,et al.  2-Connectivity in Directed Graphs: An Experimental Study , 2015, ALENEX.

[5]  Robert E. Tarjan,et al.  Edge-disjoint spanning trees and depth-first search , 1976, Acta Informatica.

[6]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[7]  Amir Abboud,et al.  Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[8]  Christian Wulff-Nilsen,et al.  Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[9]  Giorgio Gambosi,et al.  The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs , 1997, Inf. Process. Lett..

[10]  Giuseppe F. Italiano,et al.  An Experimental Study of Dynamic Dominators , 2012, ESA.

[11]  Mikkel Thorup,et al.  Dominators in Linear Time , 1999, SIAM J. Comput..

[12]  Mikkel Thorup,et al.  Near-optimal fully-dynamic graph connectivity , 2000, STOC '00.

[13]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2004, JACM.

[14]  Madhav V. Marathe,et al.  Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks , 2010, ECML/PKDD.

[15]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..

[16]  Ittai Abraham,et al.  Fully dynamic all-pairs shortest paths with worst-case update-time revisited , 2016, SODA.

[17]  Monika Henzinger,et al.  Fully dynamic biconnectivity and transitive closure , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[18]  Mikkel Thorup,et al.  Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles , 2004, SWAT.

[19]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[20]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 1998, STOC '98.

[21]  Giuseppe F. Italiano,et al.  Incremental 2-Edge-Connectivity in Directed Graphs , 2016, ICALP.

[22]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[23]  Valerie King,et al.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[24]  J. Łącki.  Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components , 2013, SODA 2013.

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

[26]  Mikkel Thorup,et al.  Planning for Fast Connectivity Updates , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[27]  Jeremy Gunawardena,et al.  A Linear Framework for Time-Scale Separation in Nonlinear Biochemical Systems , 2012, PloS one.

[28]  Monika Henzinger,et al.  Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.

[29]  Giuseppe F. Italiano,et al.  Strong Connectivity in Directed Graphs under Failures, with Applications , 2015, SODA.

[30]  Giuseppe F. Italiano,et al.  2-Edge Connectivity in Directed Graphs , 2014, SODA.

[31]  Giuseppe F. Italiano,et al.  Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure , 2001, Algorithmica.

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

[33]  Monika Henzinger,et al.  Maintaining Minimum Spanning Forests in Dynamic Graphs , 2001, SIAM J. Comput..

[34]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[35]  Giuseppe F. Italiano,et al.  2-Connectivity in Directed Graphs , 2016, ESA.

[36]  Thomas W. Reps,et al.  An incremental algorithm for maintaining the dominator tree of a reducible flowgraph , 1994, POPL '94.

[37]  Matús Mihalák,et al.  Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences , 2015, ANALCO.

[38]  James Aspnes,et al.  Inoculation strategies for victims of viruses and the sum-of-squares partition problem , 2005, SODA '05.

[39]  Haim Kaplan,et al.  Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems , 2008, SIAM J. Comput..

[40]  Giuseppe F. Italiano,et al.  Computing Critical Nodes in Directed Graphs , 2018, ALENEX.

[41]  Robert E. Tarjan,et al.  A New Approach to Incremental Cycle Detection and Related Problems , 2011, ACM Trans. Algorithms.

[42]  Piotr Sankowski,et al.  Dynamic transitive closure via dynamic matrix inverse: extended abstract , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[43]  Giuseppe F. Italiano,et al.  2-Vertex Connectivity in Directed Graphs , 2014, ICALP.

[44]  Giuseppe F. Italiano,et al.  Decremental Data Structures for Connectivity and Dominators in Directed Graphs , 2017, ICALP.