Finding All the Elementary Circuits of a Directed Graph

@article{Johnson1975FindingAT,
title={Finding All the Elementary Circuits of a Directed Graph},
author={Donald B. Johnson},
journal={SIAM J. Comput.},
year={1975},
volume={4},
pages={77-84}
}

An algorithm is presented which finds all the elementary circuits-of a directed graph in time bounded by O((n + e)(c + 1)) and space bounded by O(n + e), where there are n vertices, e edges and c elementary circuits in the graph. The algorithm resembles algorithms by Tiernan and Tarjan, but is faster because it considers each edge at most twice between any one circuit and the next in the output sequence. 1. Introduction. Broadly speaking, there are two enumeration problems on sets of objectsâ€¦Â CONTINUE READING