E. Nuutila Efficient transitive closure computation in large digraphs
PhD Thesis, Helsinki University of Technology, 1995.
Acta Polytechnica Scandinavica, Mathematics and Computing in
Engineering Series, No. 74.
A. Goralcikova and V. Koubek A reduct and closure algorithm for graphs
In Mathematical Foundations of Computer Science,
volume 74 of Lecture Notes in Computer Science, pages 301-307.
James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan Relaxed Heaps: An alternative for Fibonacci Heaps with applications to parallel computation.
Communications of the ACM, 31 (11), pp. 1343-1354, November 1988.