A search strategy for the elementary cycles of a directed graph
- 1 June 1976
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 16 (2) , 192-204
- https://doi.org/10.1007/bf01931370
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- An Optimal Algorithm to Detect a Line Graph and Output Its Root GraphJournal of the ACM, 1974
- A max {m,n} algorithm for determining the graph H from its line graph GInformation Processing Letters, 1973
- Algorithm 459: the elementary circuits of a graphCommunications of the ACM, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Nondeterministic AlgorithmsJournal of the ACM, 1967
- Systematic generation of Hamiltonian circuitsCommunications of the ACM, 1966