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

DOI10.1145/321679.321684zbMath0229.68004OpenAlexW2038605146WikidataQ92972390 ScholiaQ92972390MaRDI QIDQ5637871

Herbert Weinblatt

Publication date: 1972

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

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Stability structures of conjunctive Boolean networks ⋮ All Circuits Enumeration in Macro-Econometric Models ⋮ Enumerating the cycles of a digraph: a new preprocessing strategy ⋮ 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 ⋮ Hierarchical partition—a new optimal pivoting algorithm ⋮ A method of writing symbolically the transfer matrix of a compartmental model ⋮ Finding all the negative cycles in a directed graph

This page was built for publication: A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph