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

DOI10.1145/321679.321684MaRDI QIDQ5637871zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(9)

• Applications of graph theory in computer systems
• A method of writing symbolically the transfer matrix of a compartmental model
• A search strategy for the elementary cycles of a directed graph
• Enumerating the cycles of a digraph: a new preprocessing strategy
• All Circuits Enumeration in Macro-Econometric Models
• Hierarchical partition—a new optimal pivoting algorithm
• Stability structures of conjunctive Boolean networks
• Finding all the negative cycles in a directed graph
• The effect of unary inclusion dependencies on relational database design

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

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