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

DOI10.1145/362814.362819zbMath0225.94027OpenAlexW2085806398MaRDI QIDQ5632464

James C. Tiernan

Publication date: 1970

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362814.362819

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items

All Circuits Enumeration in Macro-Econometric Models, The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach, Counting cycles on planar graphs in subexponential time, Counting cycles on planar graphs in subexponential time, Random number generation using decimal cellular automata, Applications of graph theory in computer systems, A search strategy for the elementary cycles of a directed graph, The effect of unary inclusion dependencies on relational database design, Diagnosability of repairable faults, On convergence for hybrid models of gene regulatory networks under polytopic uncertainties: a Lyapunov approach, Enumerating Minimal Dominating Sets in Triangle-Free Graphs, Unnamed Item, Intersections and circuits in sets of line segments, Finding all the negative cycles in a directed graph