1. Aho, A.V., Hopcroft, J.E., Ullman, J.: The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co., Boston (1974)
2. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economical construction of the transitive closure of an oriented graph. Soviet Math. Dokl. 11, 1209–1210 (1970)
3. Lecture Notes in Computer Science;T.M. Chan,2005
4. Chan, T.M.: All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In: Proc. SODA, pp. 514–523 (2006)
5. Cheriyan, J., Mehlhorn, K.: Algorithms for dense graphs and networks on the random access computer. Algorithmica 15(6), 521–549 (1996)