A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
From MaRDI portal
Publication:5637871
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)