An experimental study of algorithms for fully dynamic transitive closure

We have conducted an extensive experimental study on algorithms for fully dynamic transitive closure. We have implemented the recent fully dynamic algorithms by King [1999], Roditty [2003], Roditty and Zwick [2002, 2004], and Demetrescu and Italiano [2000, 2005] along with several variants and compared them to pseudo fully dynamic and simple-minded algorithms developed in a previous study [Frigioni et al. 2001]. We tested and compared these implementations on random inputs, synthetic (worst-case) inputs, and on inputs motivated by real-world graphs. Our experiments reveal that some of the dynamic algorithms can really be of practical value in many situations.

[1]  Giuseppe F. Italiano,et al.  Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  Giuseppe Cattaneo,et al.  Experimental analysis of dynamic minimum spanning tree algorithms , 1997, SODA '97.

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

[4]  Mikkel Thorup,et al.  A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms , 2001, COCOON.

[5]  Uri Zwick,et al.  Improved Dynamic Reachability Algorithms for Directed Graphs , 2008, SIAM J. Comput..

[6]  Giuseppe F. Italiano,et al.  Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier , 2005, JACM.

[7]  Walter Didimo,et al.  Universit a Degli Studi Di Roma \la Sapienza" Fully Dynamic Algorithms for Path Problems on Directed Graphs Fully Dynamic Algorithms for Path Problems on Directed Graphs , 2001 .

[8]  Liam Roditty,et al.  A faster and simpler fully dynamic transitive closure , 2003, SODA '03.

[9]  Christos D. Zaroliagis,et al.  Implementations and Experimental Studies of Dynamic Graph Algorithms , 2000, Experimental Algorithmics.

[10]  Umberto Ferraro Petrillo,et al.  Maintaining dynamic minimum spanning trees: An experimental study , 2002, Discret. Appl. Math..

[11]  Christos D. Zaroliagis,et al.  An Experimental Study of Algorithms for Fully Dynamic Transitive Closure , 2005, ESA.

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

[13]  Valerie King,et al.  A fully dynamic algorithm for maintaining the transitive closure , 1999, STOC '99.

[14]  Laurent Joncheray,et al.  Representation of IP Routing Policies in a Routing Registry (ripe-81++) , 1995, RFC.

[15]  Giuseppe Cattaneo,et al.  A Software Library of Dynamic Graph Algorithms , 1998 .

[16]  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).

[17]  Giuseppe F. Italiano,et al.  Finding Paths and Deleting Edges in Directed Acyclic Graphs , 1988, Inf. Process. Lett..

[18]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[19]  Paul G. Spirakis,et al.  Expected parallel time and sequential space complexity of graph and digraph problems , 2011, Algorithmica.

[20]  Mikkel Thorup,et al.  An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms , 2001, JEAL.

[21]  Giuseppe F. Italiano,et al.  Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.

[22]  Daniele Frigioni,et al.  Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study , 2000, WAE.

[23]  Giuseppe F. Italiano,et al.  Amortized Efficiency of a Path Retrieval Data Structure , 1986, Theor. Comput. Sci..

[24]  Uri Zwick,et al.  A fully dynamic reachability algorithm for directed graphs with an almost linear update time , 2004, STOC '04.

[25]  Piotr Sankowski,et al.  Dynamic Transitive Closure via Dynamic Matrix Inverse , 2004 .

[26]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[27]  Daniele Frigioni,et al.  Experimental analysis of dynamic algorithms for the single source shortest paths problem , 1998, JEAL.

[28]  Daniele Frigioni,et al.  An Experimental Study of Dynamic Algorithms for Transitive Closure , 2001, JEAL.

[29]  Giuseppe Cattaneo,et al.  An empirical study of dynamic graph algorithms , 1996, SODA '96.