A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
- 1 January 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (1), 43-56
- https://doi.org/10.1145/321679.321684
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- An efficient search algorithm to find the elementary circuits of a graphCommunications of the ACM, 1970
- The application of graphs to the analysis of distribution of loops in a programInformation and Control, 1964