On Algorithms for Enumerating All Circuits of a Graph
- 1 March 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (1), 90-99
- https://doi.org/10.1137/0205007
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- An algorithm for the blocks and cutnodes of a graphCommunications of the ACM, 1971
- A Cycle Generation Algorithm for Finite Undirected Linear GraphsJournal of the ACM, 1969
- An algorithm for finding a fundamental set of cycles of a graphCommunications of the ACM, 1969
- On finding the simple paths and circuits in a graphIEEE Transactions on Circuit Theory, 1968
- Nondeterministic AlgorithmsJournal of the ACM, 1967
- A Systematic Method of Finding All Directed Circuits and Enumerating All DIrected PathsIEEE Transactions on Circuit Theory, 1967
- The number of paths and cycles in a digraphPsychometrika, 1966
- A matrix method for location of cycles of a directed graphAIChE Journal, 1965