GSPeeDI --- A Verification Tool for Generalized Polygonal Hybrid Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Reachability analysis of GSPDIs: theory, optimization, and implementation
Proceedings of the 2010 ACM Symposium on Applied Computing
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
The Limitations of the BP Algorithm for Counting Cycles in Random Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Estimation algorithm for counting periodic orbits in complex social networks
Information Systems Frontiers
| Hi-index | 0.00 |
An algorithm to enumerate all the elementary circuits of a directed graph is presented. The algorithm uses back-tracking with lookahead to avoid unnecessary work, and it has a time bound of $O ((V+E)(C+1))$ when applied to a graph with $V$ vertices, $E$ edges, and $C$ elementary circuits. Keywords: Algorithm, circuit, cycle, graph