论文信息 - Enumerating all simple paths in a graph

Enumerating all simple paths in a graph

Warshail's Theorem is used to obtain a matrix power algorithm for enumerating all simple paths in a graph. The algorithm uses O(N^{3}) matrix operations, compared to O(N^{4}) operations for previous algorithms.

Frank L. Rubin | F. Rubin

[1] J. Ponstein,et al. Self-Avoiding Paths and the Adjacency Matrix of a Graph , 1966 .

[2] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[3] G. Danielson,et al. On finding the simple paths and circuits in a graph , 1968 .