1. Effective algorithms for the solution of certain problems in directed graphs;Faradzev;Ž. Vičisl. Mat. i Mat. Fiz.,1970
2. An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix;Fox;Commun. ACM,1968
3. Recherche des chemins et circuits hamiltoniens d'un graphe;Kaufman;Rev. Française Rech. Operationelle,1963
4. Efficient determination of the transitive closure of a directed graph;Munroe;Inform. Processing Letters,1971
5. A transitive closure algorithm;Purdom,1968