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

DOI10.1145/362814.362819MaRDI QIDQ5632464zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(16)

• The effect of unary inclusion dependencies on relational database design
• Finding all the negative cycles in a directed graph
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
• Diagnosability of repairable faults
• On convergence for hybrid models of gene regulatory networks under polytopic uncertainties: a Lyapunov approach
• Intersections and circuits in sets of line segments
• 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
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs
• Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
• All Circuits Enumeration in Macro-Econometric Models
• Counting cycles on planar graphs in subexponential time
• Counting cycles on planar graphs in subexponential time
• Evaluation of radiality constraints for power distribution networks
• From amortized to worst case delay in enumeration algorithms

This page was built for publication: An efficient search algorithm to find the elementary circuits of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632464)