An experimental study of dynamic algorithms for transitive closure

ACM Journal of Experimental Algorithmics

Volumn 6, Issue , 2001, Pages

  Frigioni, Daniele ^a   Miller, Tobias ^b   Nanni, Umberto ^c   Zaroliagis, Christos ^d  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b Informatik und Logistik Consulting   (Germany)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d UNIVERSITY OF PATRAS   (Greece)

Author keywords

Dynamic Algorithm; Experimentation; Transitive Closure

Indexed keywords

EID: 0012582935     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/945394.945403     Document Type: Article

References (32)

1. D. Alberts, G. Cattaneo, and G. F. Italiano. An empirical study of dynamic graph algo- rithms. ACM Journal of Experimental Algorithmics, 2, 1997, Art. # 5.
2. G. Amato, G. Cattaneo, and G. F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms. In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, 314-323.
3. D. Alberts, G. Cattaneo, G.F. Italiano, U. Nanni, and C. Zaroliagis. A software library of dynamic graph algorithms. In Proc. Workshop on Algorithms and Experiments, 1998, 129-136.
4. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni. Incremental algorithms for minimal length paths. Journal of Algorithms, 12, 1991, 615-638.
5. B. Bollobas. Random Graphs. Academic Press, New York, 1985.
6. T. Bates, E. Gerich, L. Joncheray, J-M. Jouanigot, D. Karrenberg, M. Terpstra, and J. Yu. Representation of IP routing policies in a routing registry. Technical report, RIPE-181, October 1994.
7. S. Chaudhuri, and C. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27 (3), 2000, 212-226.
8. S. Cicerone, D. Frigioni, U. Nanni, and F. Pugliese. A uniform approach to semi dynamic problems in digraphs. Theoretical Computer Science, 203 (1), 1998, 69-90.
9. C. Demetrescu and G. F. Italiano. Fully dynamic transitive closure: Breaking through the 0(n2 ) barrier. In Proc. Jilst IEEE Symp. on Foundations of Computer Science, 2000, 381-389.
10. C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proc. 4th Workshop on Algorithm Engineering - WAE 2001. Lecture Notes in Computer Science, Vol. 1982, 2001, 218-229.
11. H. Djidjev, G. Pantziou, and C. Zaroliagis. Improved algorithms for dynamic shortest paths. Algorithmica, 28 (4), 2000, 367-389.
12. D. Eppstein, Z. Galil, G. F. Italiano. Dynamic graph algorithms. CRC Handbook of Algorithms and Theory of Computation, Chapter 22, CRC Press, 1999.
13. D. Eppstein, Z. Galil, G.F. Italiano, A. Nissenzweig. Sparsification-A technique for speeding up dynamic graph algorithms. Journal of the ACM, 44, 1997, 669-696.
14. D. Eppstein, Z. Galil, G. F. Italiano, T. H. Spencer. Separator based sparsification I: Planarity testing and minimum spanning trees. Journal of Computer and System Sciences, 52 (1), 1996, 3-27. Special issue of STOC'93.
15. D. Eppstein, Z. Galil, G. F. Italiano, T. H. Spencer. Separator based sparsification II: Edge and vertex connectivity. SIAM Journal on Computing, 28, 1999, 341-381.
16. S. Even and Y. Shiloach. An on-Line edge deletion problem. J. of the ACM, 28, 1981, 1-4.
17. D. Frigioni, M. Ioffreda, U. Nanni, and G. Pasqualone. Experimental analysis of dynamic algorithms for the single source shortest paths problem. ACM Journal of Experimental Algorithmics, 3, 1998, Art. #5.
18. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms, 34 (2), 2000, 251-281.
19. D. Frigioni, A. Marchetti-Spaccamela, U. Nanni. Fully dynamic shortest paths and negative cycles detection in digraphs with arbitrary arc weights. In Proc. 6th European Symposium on Algorithms - ESA'98. Lecture Notes in Computer Science, Vol. 1461, 1998, 320-331.
20. D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Schafer, and C. Zaroliagis. An experimental study of dynamic algorithms for directed graphs. In Proc. 6th European Symposium, on, Algorithms - ESA'98. Lecture Notes in Computer Science, Vol. 1461, 1998, 368-380.
21. A. Goralcikova, and V. Konbeck. A reduct and closure algorithm for graphs. In Proc. 4th Mathematical Foundations of Computer Science - MFCS'79. Lecture Notes in Computer Science, Vol. 74, 1979, 301-307.
22. M. R. Henzinger, and V. King. Randomized dynamic graph algorithms with polylogarith- mic time per operation. In Proc. 27th ACM Symp. on Theory of Comp., 1995, 519-527.
23. M. R. Henzinger, and V. King. Fully dynamic biconnectivity and transitive closure. In Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995, 664-672.
24. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Symposium, on, Foundations of Computer Science, 1999, 81-91.
25. V. King, and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. In Proc. 31st ACM Symposium on Theory of Computing, 1999, 492-498.
26. G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theoretical Computer Science, 48, 1986, 273-281.
27. G. F. Italiano. Finding paths and deleting edges in directed acyclic graphs. Information Processing Letters, 28, 1998, 5-11.
28. J. A. La Poutre, and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Proc. 14th Workshop on Graph-Theoretic Concepts in Computer Science - WG'88. Lecture Notes in Computer Science, Vol. 314, 1988, 106-120.
29. K. Mehlhorn and S. Naher. LED A - A platform for combinatorial and geometric computing. Cambridge University Press, 1999.
30. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158, 1996, 233-277.
31. M. Rauch. Improved data structures for fully dynamic biconnectivity. In Proc. 26th ACM Symposium on Theory of Computing, 1994, 686-695.
32. D. M. Yellin. Speeding up dynamic transitive closure for bounded degree graphs. Acta Informatica, 30, 1993, 369-384.