Loading [MathJax]/extensions/MathMenu.js
Enumerating all simple paths in a graph | IEEE Journals & Magazine | IEEE Xplore

Enumerating all simple paths in a graph


Abstract:

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}...Show More

Abstract:

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.
Published in: IEEE Transactions on Circuits and Systems ( Volume: 25, Issue: 8, August 1978)
Page(s): 641 - 642
Date of Publication: 06 January 2003

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.