1. A theorem on Boolean matrices;Warshall;J. ACM,1962
2. Calculating the Floyd-Warshall path algorithm;Backhouse,1992
3. Calculating path algorithms;Backhouse;Sci. Comput. Programming,1994
4. Efficient transitive closure computation in large digraphs;Nuutila,1995
5. The input/output complexity of transitive closure;Ullman,1990