Enumerating all simple paths in a graph
Frank Rubin · IEEE Transactions on Circuits and Systems · 1978
Warshail's Theorem is used to obtain a matrix power algorithm for enumerating all simple paths in a graph. The algorithm usesO(N^{3})matrix operations, compared toO(N^{4})operations for previous algorithms.