Finding All the Elementary Circuits of a Directed Graph

  title={Finding All the Elementary Circuits of a Directed Graph},
  author={D. B. Johnson},
  journal={SIAM J. Comput.},
  • D. B. Johnson
  • Published 1975
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 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. 

    Figures, Tables, and Topics from this paper.

    SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
    • 367
    • PDF
    Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
    • 478
    • PDF
    Cycle-static dataflow
    • 491
    Path-based scheduling for synthesis
    • 239
    • PDF
    Optimal Listing of Cycles and st-Paths in Undirected Graphs
    • 55
    • PDF
    A new way to enumerate cycles in graph
    • 65
    Efficient algorithms for listing combinatorial structures
    • 109
    • PDF


    Publications referenced by this paper.
    Enumeration of the Elementary Circuits of a Directed Graph
    • 250
    • PDF
    An efficient search algorithm to find the elementary circuits of a graph
    • 217
    • Highly Influential
    A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
    • 89
    Depth first search and linear graph algorithms
    • 2,184