| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434627 | Theoretical Computer Science | 2013 | 10 Pages |
Abstract
We present an algorithm to generate bracelets with fixed content. An analysis shows that the algorithm runs in constant amortized time. The algorithm can be applied to efficiently list all non-isomorphic unicyclic graphs with n vertices.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
