research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Article
Entered by:
TitleAn Experimental Study of Dynamic Algorithms for Transitive Closure'
Bibtex cite IDRACTI-RU1-2001-22
Journal ACM Journal of Experimental Algorithmics
Year published 2001
Volume 6
Number 9
Pages 1-42
We perform an extensive experimental study of several dynamic algorithms for transitive closure. In particular, we implemented algorithms given by Italiano, Yellin, Cicerone et al., and two recent randomized algorithms by Henzinger and King. We propose a fine-tuned version of Italiano's algorithms as well as a new variant of them, both of which were always faster than any of the other implementations of the dynamic algorithms. We also considered simple-minded algorithms that were easy to implement and likely to be fast in practice. Wetested and compared the above implementations on random inputs, on non-random inputs that are worst-case inputs for the dynamic algorithms, and on an input motivated by a real-world graph.
Frigioni, D.
Miller, T.
Nanni, U.
Zaroliagis, Christos
J17-FMNZ-ACM-JEA-Vol6-No9-2001.pdf (main file)
Publication ID409