Accession Number:

AD0750296

Title:

Enumeration of the Elementary Circuits of a Directed Graph,

Descriptive Note:

Corporate Author:

CORNELL UNIV ITHACA N Y DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1972-09-01

Pagination or Media Count:

16.0

Abstract:

An algorithm to enumerate all the elementary circuits of a directed graph is presented. The algorithm uses backtracking with lookahead to avoid unnecessary work, and it has a time bound of 0VEC1 when applied to a graph with V vertices, E edges, and C elementary circuits. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE