Enumerating the cycles of a digraph: A new preprocessing strategy
- 31 August 1982
- journal article
- Published by Elsevier in Information Sciences
- Vol. 27 (3) , 163-182
- https://doi.org/10.1016/0020-0255(82)90023-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algebraic determination of circuits in a directed graphInternational Journal of Systems Science, 1979
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- A Time-Space Trade-OffJournal of the ACM, 1978
- Zur bestimmung aller elementarkreise in gerichteten graphenMathematische Operationsforschung und Statistik. Series Optimization, 1978
- A search strategy for the elementary cycles of a directed graphBIT Numerical Mathematics, 1976
- On Algorithms for Enumerating All Circuits of a GraphSIAM Journal on Computing, 1976
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- Algorithm 459: the elementary circuits of a graphCommunications of the ACM, 1973
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972