论文信息 - Generating bracelets with fixed content - 字舞流文

Generating bracelets with fixed content

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.

Joe Sawada | Syed Husnine | Zareen Alamgir | Saira Karim

[1] Frank Ruskey,et al. An efficient algorithm for generating necklaces with fixed density , 1999, SODA '99.

[2] Joe Sawada,et al. Generating Bracelets in Constant Amortized Time , 2001, SIAM J. Comput..

[3] Harold Fredricksen,et al. An algorithm for generating necklaces of beads in two colors , 1986, Discret. Math..

[4] Harold Fredricksen,et al. Necklaces of beads in k colors and k-ary de Bruijn sequences , 1978, Discret. Math..

[5] Charles Ashbacher. The Art of Computer Programming, Volume 4: Generating All Trees, History of Combinatorial Generation , 2007, J. Object Technol..

[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[7] Joe Sawada,et al. A fast algorithm to generate necklaces with fixed content , 2003, Theor. Comput. Sci..

[8] Donald E. Knuth,et al. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[9] Frank Ruskey,et al. Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) , 2000, J. Algorithms.