Journal article
A search strategy for the elementary cycles of a directed graph
Abstract
The most successful known algorithms enumerating the elementary cycles of a directed graph are based on a backtracking strategy. Such existing algorithms are discussed and a new backtracking algorithm is proposed which is bounded byO(N +M(C + 1)) time, for a directed graph withN vertices,M edges andC elementary cycles.
Authors
Szwarcfiter JL; Lauer PE
Journal
BIT Numerical Mathematics, Vol. 16, No. 2, pp. 192–204
Publisher
Springer Nature
Publication Date
June 1976
DOI
10.1007/bf01931370
ISSN
0006-3835