A user-friendly interface for evaluating preference queries over tabular data
Proceedings of the 26th annual ACM international conference on Design of communication
High performance asynchronous design flow using a novel static performance analysis method
Computers and Electrical Engineering
Complete enumeration of compact structural motifs in proteins
ISB '10 Proceedings of the International Symposium on Biocomputing
Process variation-aware performance analysis of asynchronous circuits
Microelectronics Journal
Deadlock avoidance for streaming computations with filtering
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Computation non-intensive estimation algorithm for counting cycles in random networks
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
PATMOS'09 Proceedings of the 19th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation
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
Cooperating to buy shoes in the real world: online cycle picking in directed graphs
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Cooperating to buy shoes: an application of picking cycles in directed graphs
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
| Hi-index | 0.00 |
In many cases, the topology of communcation systems can be abstracted and represented as graph. Graph theories and algorithms are useful in these situations. In this paper, we introduced an algorithm to enumerate all cycles in a graph. It can be applied on digraph or undirected graph. Multigraph can also be used on for this purpose. It can be used to enumerate given length cycles without enumerating all cycles. This algorithm is simple and easy to be implemented.