A sensitive transitive closure algorithm

Arlazarov, 1970, On economical construction of the transitive closure of a directed graph, Soviet Math. Dokl., 11 Booth, 1977, Boolean matrix multiplication using only O(nlog 7(log n)) bit operations, SIGACT News, 10.1145/1008361.1008362 Mahr, 1980, A bird's eye view to path problems Tarjan, 1972, Depth-first search and linear graph algorithms, SIAM J. Comput., 1, 146, 10.1137/0201010 Warshall, 1962, A theorem on Boolean matrices, J. ACM, 9, 11, 10.1145/321105.321107