Enumeration of the Elementary Circuits of a Directed Graph,
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1972
- Accession Number
- AD0750296
Entities
People
- Robert Tarjan
Organizations
- Department of Computer Science, Cornell University