# Finding All the Elementary Circuits of a Directed Graph

@article{Johnson1975FindingAT, title={Finding All the Elementary Circuits of a Directed Graph}, author={D. 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.

691 Citations

SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model

- Computer Science
- 2011

- 367
- PDF

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

- Computer Science, Medicine
- 2004

- 478
- PDF

Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration

- Computer Science
- 1998

- 598
- PDF

Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement

- Mathematics, Computer Science
- 2005

- 208
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-5 OF 5 REFERENCES

An efficient search algorithm to find the elementary circuits of a graph

- Computer Science
- 1970

- 217
- Highly Influential

A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph

- Computer Science
- 1972

- 89