An Experimental Study of Algorithms for Fully Dynamic Transitive Closure

ACM Journal of Experimental Algorithmics

Volumn 12, Issue , 2008, Pages 1-22

  Krommidas, Ioannis ^a   Zaroliagis, Christos ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Algorithm; Design; dynamic algorithm; Experimentation; Measurement; path; Performance; reachability; Transitive closure

Indexed keywords

EID: 84977964404     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/1227161.1370597     Document Type: Article

References (27)

1. Abdeddaim, S. 2000. Algorithms and experiments on transitive closure, path cover and multiple sequence alignment. In Proc. 2nd Workshop on Algorithm Engineering and Experiments—ALENEX2000. 157-169.
2. Alberts, D., Cattaneo, G., and Italiano, G. F. 1997. An empirical study of dynamic graph algorithms. ACM Journal of Experimental Algorithmics 2, 5. Preliminary version in Proc. SODA’96 Alberts, D., Cattaneo, G., Italiano, G., Nanni, U., and Zaroliagis, C. 1998. A software library of dynamic graph algorithms. In Proc. Workshop on Algorithms and Experiments—ALEX98. 129-136.
3. Amato, G., Cattaneo, G., and Italiano, G. F. 1997. Experimental analysis of dynamic minimum spanning tree algorithms. In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms—SODA97. 314-323.
4. Bates, T., Gerich, E., Joncheray, L., Jouanigot, J.-M., Karrenberg, D., Terpstra, M., and Yu, J. 1994. Representation of ip routing policies in a routing registry. Tech. Rep. RIPE-181. (Oct.).
5. Bollobas, B. 1985. Random Graphs. Academic Press, New York.
6. Cattaneo, G., Faruolo, P., Ferraro-Petrillo, U., and Italiano, G. 2002 Maintaining dynamic minimum spanning trees: An experimental study. In Proc. 4th Workshop on Algorithm Engineering and Experiments—ALENEX2002.
7. 2) barrier. In Proc. 41st IEEE Symp. on Foundations of Computer Science—FOCS 2000. 381-389.
8. Demetrescu, C. and Italiano, G. F. 2006. Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms 2, 4, 578-601. Special issue on SODA 2004.
9. Demetrescu, C., Frigioni, D., Marchetti-Spaccamela, A., and Nanni, U. 2000. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Algorithm Engineering—WAE 2000. Lecture Notes in Computer Science, vol. 1982. Springer, New York. 218-229.
10. Demetrescu, C., Emiliozzi, S., and Italiano, G. F. 2004. Experimental analysis of dynamic all pairs shortest path algorithms. In Proc. 15th ACM-SIAM Symp. on Discrete Algorithms—SODA 2004. 362-371.
11. 2) barrier. Journal of the ACM 52, 2, 147-156.
12. Frigioni, D., Ioffreda, M., Nanni, U., and Pasqualone, G. 1998. Experimental analysis of dynamic algorithms for the single source shortest paths problem. ACM Journal of Experimental Algorithmics 3,5.
13. Frigioni, D., Miller, T., Nanni, U., and Zaroliagis, C. 2001. An experimental study of dynamic algorithms for transitive closure. ACM Journal of Experimental Algorithmics 6,9. Henzinger, M. and King, V. 1995. Fully dynamic biconnectivity and transitive closure. In Proc. 36th IEEE Symposium on Foundations of Computer Science—FOCS’95. 664-672.
14. Italiano, G. F. 1986. Amortized efficiency of a path retrieval data structure. Theoretical Computer Science 48, 273-281.
15. Italiano, G. F. 1988. Finding paths and deleting edges in directed acyclic graphs. Information Processing Letters 28, 5-11.
16. Iyer, R., Karger, D., Rahul, H., and Thorup, M. 2000. An experimental study of poly-logarithmic fully-dynamic connectivity algorithms. In Proc. 2nd Workshop on Algorithm Engineering and Experiments—ALENEX2000. 59-78.
17. King, V. 1999. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Symposium on Foundations of Computer Science—FOCS’99. 81-91.
18. King, V. and Sagert, G. 1999. A fully dynamic algorithm for maintaining the transitive closure. In Proc. 31st ACM Symposium on Theory of Computing—STOC’99. 492-498.
19. King, V. and Thorup, M. 2001. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In Computation and Combinatorics—COCOON 2001. Lecture Notes in Computer Science, vol. 2108. Springer, New York. 268-277.
20. Krommidas, I. and Zaroliagis, C. 2005. An experimental study of algorithms for fully dynamic transitive closure. In Algorithms—ESA 2005. Lecture Notes in Computer Science, vol. 3669. Springer, 544-555.
21. Mehlhorn, K. and NAher, S. 1999. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge university Press, Cambridge.
22. Reif, J. and Spirakis, P. 1992. Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica 7, 597-630.
23. Roditty, L. 2003. A faster and simpler fully dynamic transitive closure. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms—SODA 2003. 404-412.
24. Roditty, L. and Zwick, U. 2002. Improved dynamic reachability algorithms for directed graphs. In Proc. 43rd IEEE Symposium on Foundations of Computer Science—FOCS 2002. 679-690.
25. Roditty, L. and Zwick, U. 2004. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proc. 36th ACM Symp. on Theory of Computing—STOC 2004.
26. Sankowski, P. 2004. Dynamic transitive closure via dynamic matrix inverse. In Proc. 45th IEEE Symposium on Foundations of Computer Science—FOCS 2004. 509-517. Valgrind. 2006. http://valgrind.kde.org/.
27. Zaroliagis, C. 2002. Implementations and experimental studies of dynamic graph algorithms. In Experimental Algorithmics. Springer, New York. Chapter 11, 229-278.