References
- K. Cattell, F. Ruskey, J. Sawada, M. Serra, and C.R. Miers, Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2), J. Algorithms 37 (2000), pp. 267–282. doi: 10.1006/jagm.2000.1108
- V.M.F. Dias, C.M.H. Figueiredo, and J.L. Szwarcfiter, On the generation of bicliques of a graph, Discrete Appl. Math. 155 (2007), pp. 1826–1832. doi: 10.1016/j.dam.2007.03.017
- P. Emmel and R. Hersch, Exploring ink spreading, Proceedings of the 8th IS and T/SID Color Imaging Conference: Color Science and Engineering, Scottsdale, AZ, 2000, pp. 335–341.
- E.N. Gilbert and J. Riordan, Symmetry types of periodic sequences, Illinois J. Math. 5 (1961), pp. 657–665.
- Y. Ishida, Y. Kato, L. Zhao, H. Nagamochi, and T. Akutsu, Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut, J. Chem. Inf. Model. 50 (2010), pp. 934–946. doi: 10.1021/ci900447z
- S. Karim, J. Sawada, Z. Alamgir, and S.M. Husnine, Generating bracelets with fixed content, Theor. Comput. Sci. 475 (2013), pp. 103–112, doi:10.1016/j.tcs.2012.11.024. doi: 10.1016/j.tcs.2012.11.024
- D.E. Knuth, The Art of Computer Programming Volume 4A, Combinatorial Algorithms, Addison-Wesley, Reading, MA, 2011.
- P. Lisonek, Computer assisted studies in algebraic combinatorics, Dissertation, Johannes Kepler University, Linz, Austria, 1994.
- F. Ruskey, Combinatorial Generation, Working Version, University of Victoria, Victoria, BC, Canada, 2003. Available at http://www.1stworks.com/ref/RuskeyCombGen.pdf.
- F. Ruskey and J. Sawada, An efficient algorithm for generating necklaces of fixed density, SIAM J. Comput. 29 (1999), pp. 671–684. doi: 10.1137/S0097539798344112
- F. Ruskey, C. Savage, and T. Wang, Generating necklaces, J. Algorithms 13 (1992), pp. 3247–3259. doi: 10.1016/0196-6774(92)90047-G
- J. Sawada, Generating bracelets in constant amortized time, SIAM J. Comput. 31 (2001), pp. 259–268. doi: 10.1137/S0097539700377037
- J. Sawada, A fast algorithm to generate necklaces with fixed content, Theoret. Comput. Sci. 301 (2003), pp. 447–489. doi: 10.1016/S0304-3975(03)00049-5
- T. Uno, An efficient algorithm for solving pseudo clique enumeration problem, Algorithmica 56 (2010), pp. 3–16. doi: 10.1007/s00453-008-9238-3
- V. Vajnovszki, Gray code order for Lyndon words, Discrete Math. Theor. Comput. Sci. 9 (2007), pp. 145–152.
- V. Vajnovszki, More restrictive Gray codes for necklaces and Lyndon words, Inform. Process. Lett. 106 (2008), pp. 96–99. doi: 10.1016/j.ipl.2007.10.011
- M. Weston and V. Vajnovszki, Gray codes for necklaces and Lyndon words of arbitrary base, Pure Math. Appl. 17 (2006), pp. 175–182.