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
Highly Influential
This paper has highly influenced 32 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 746 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 321 extracted citations

746 Citations

050'78'88'99'10
Citations per Year
Semantic Scholar estimates that this publication has 746 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

An algorithm for finding the elementary circuits of a directed graph

  • A Ehrenfeucht, L Fosdick, L Osterweil
  • An algorithm for finding the elementary circuits…
  • 1973
3 Excerpts

Similar Papers

Loading similar papers…