Advertisement

An Experimental Study of Algorithms for Fully Dynamic Transitive Closure

  • Ioannis Krommidas
  • Christos Zaroliagis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)

Abstract

We have conducted an extensive experimental study on some recent, theoretically outstanding, algorithms for fully dynamic transitive closure along with several variants of them, and compared them to pseudo fully dynamic and simple-minded algorithms developed in a previous study. 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 fully dynamic algorithms can really be of practical value in many situations.

Keywords

Transitive Closure Random Input Dynamic Algorithm Strongly Connect Component Edge Deletion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdeddaim, S.: Algorithms and Experiments on Transitive Closure, Path Cover and Multiple Sequence Alignment. In: Proc. 2nd Workshop on Algorithm Engineering and Experiments – ALENEX 2000, pp. 157–169 (2000)Google Scholar
  2. 2.
    Alberts, D., Cattaneo, G., Italiano, G.F., Nanni, U., Zaroliagis, C.: A Software Library of Dynamic Graph Algorithms. In: Proc. Workshop on Algorithms and Experiments – ALEX 1998, pp. 129–136 (1998)Google Scholar
  3. 3.
    Demetrescu, C., Emiliozzi, S., Italiano, G.F.: Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms – SODA 2004, pp. 362–371 (2004)Google Scholar
  4. 4.
    Demetrescu, C., Italiano, G.F.: Fully Dynamic Transitive Closure: Breaking through the O(n 2) Barrier. In: Proc. 41st IEEE Symp. on Foundations of Computer Science – FOCS 2000, pp. 381–389 (2000)Google Scholar
  5. 5.
    Demetrescu, C.: Fully Dynamic Algorithms for Path Problems on Directed Graphs. PhD Thesis, University of Rome “La Sapienza” (February 2001)Google Scholar
  6. 6.
    Frigioni, D., Miller, T., Nanni, U., Zaroliagis, C.: An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM Journal of Experimental Algorithmics 6(9) (2001)Google Scholar
  7. 7.
    Henzinger, M.R., King, V.: Fully Dynamic Biconnectivity and Transitive Closure. In: Proc. 36th IEEE Symposium on Foundations of Computer Science – FOCS 1995, pp. 664–672 (1995)Google Scholar
  8. 8.
    Italiano, G.F.: Amortized efficiency of a path retrieval data structure. Theoretical Computer Science 48, 273–281 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Italiano, G.F.: Finding paths and deleting edges in directed acyclic graphs. Information Processing Letters 28, 5–11 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    King, V.: 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 1999, pp. 81–91 (1999)Google Scholar
  11. 11.
    King, V., Sagert, G.: A Fully Dynamic Algorithm for Maintaining the Transitive Closure. In: Proc. 31st ACM Symp. on Theory of Comp., STOC 1999, pp. 492–498 (1999)Google Scholar
  12. 12.
    King, V., Thorup, M.: A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 268–277. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Krommidas, I., Zaroliagis, C.: An Experimental Study of Algorithms for Fully Dynamic Transitive Closure. CTI Tech. Report TR 2005/07/01 (July 2005)Google Scholar
  14. 14.
    Mehlhorn, K., Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  15. 15.
    Roditty, L.: A faster and simpler fully dynamic transitive closure. Proc. 14th ACM-SIAM Symp. on Discrete Algorithms – SODA 2003, pp. 404–412 (2003)Google Scholar
  16. 16.
    Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. In: Proc. 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002, pp. 679–690 (2002)Google Scholar
  17. 17.
    Roditty, L., Zwick, U.: 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 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ioannis Krommidas
    • 1
    • 2
  • Christos Zaroliagis
    • 1
    • 2
  1. 1.Computer Technology InstitutePatrasGreece
  2. 2.Dept of Computer Engineering and InformaticsUniversity of PatrasPatrasGreece

Personalised recommendations