Publisher
Springer Nature Switzerland
Reference22 articles.
1. Warshall, S.: A theorem on boolean matrices. J. Assoc. Comput. Mach. 9, 11–12 (1962)
2. Roy, B.: Trasitivite et connexite. C.R. Acad. Sci. Paris Der. A-B 249, 216–218 (1959)
3. Floyd, W.R.: Algorithm 97: shortest path. Comm. ACM 5, 344–345 (1962)
4. Dijkstra, E.W.: A note on two problems in connexion with graphs. Num. Math. 1, 269–271 (1959)
5. Schnorr, C.P.: An algorithm for transitive closure with linear expected time. SIAM J. Computing 7(2), 127–133 (1978)