
Accession Number : AD0750296
Title : Enumeration of the Elementary Circuits of a Directed Graph,
Corporate Author : CORNELL UNIV ITHACA N Y DEPT OF COMPUTER SCIENCE
Personal Author(s) : Tarjan,Robert
Report Date : SEP 1972
Pagination or Media Count : 16
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 0((V+E)(C+1)) when applied to a graph with V vertices, E edges, and C elementary circuits. (Author)
Descriptors : (*GRAPHICS, ALGORITHMS), TOPOLOGY, MATHEMATICAL LOGIC, POLYNOMIALS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE