1. Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131–137 (1972)
2. Alves, C.E.R., Cáceres, E.N., de Castro, A.A., Song, S.W., Szwarcfiter, J.L.: Parallel transitive closure algorithm. J. Braz. Comp. Soc. 19(2), 161–166 (2013)
3. Chen, Y., Chen, Y.: Decomposing dags into spanning trees: A new way to compress transitive closures. In: Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11–16, 2011, Hannover, Germany, pp. 1007–1018 (2011)
4. Cheng, J., Huang, S., Wu,H., Fu, A.W.: Tf-label: a topological-folding labeling scheme for reachability querying in a large graph. In: SIGMOD, pp. 193–204 (2013)
5. Cohen, E.: Estimating the size of the transitive closure in linear time. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20–22 November 1994, pp. 190–200 (1994)