다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Discrete mathematics, v.307 no.13, 2007년, pp.1559 - 1571
Baril, J.-L.
AI-Helper
We give the first Gray code for the set of n-length permutations with a given number of cycles. In this code, each permutation is transformed into its successor by a product with a cycle of length three, which is optimal. If we represent each permutation by its transposition array then the obtained ...
Discrete Appl. Math. Baril 140 1-3 207 2004 10.1016/j.dam.2003.06.002 Gray code for derangements
Designs, Codes and Cryptography Chu 32 51 2004 10.1023/B:DESI.0000029212.52214.71 Constructions for permutation codes in powerline communications
A. Juarna, V. Vajnovszki, Isomorphism between classes counted by Fibonacci numbers, Words 2005, September 2005, pp. 51-62.
D.E. Knuth, The Art of Computer Programming, Combinatorial Algorithms, vol. 4, Pre-fascicle 2b, Generating all permutations, 2002.
Discrete Math. Korsh 240 1-3 97 2001 10.1016/S0012-365X(00)00387-3 Loopless generation of up-down permutations
Congr. Numer. Roelants van Baronaigien 90 87 1992 Constant time generation of involutions
F. Ruskey, 〈http://www.theory.cs.uvic.ca/∼cos/gen/perm.html〉.
10.1007/3-540-57568-5_250 F. Ruskey, Simple combinatorial Gray codes constructed by reversing sublists in ISAAC conference, Lecture Notes in Computer Science, vol. 762, Springer, Berlin, 1993, pp. 201-208.
Inform. Process. Lett. Ruskey 86 2 107 2003 10.1016/S0020-0190(02)00481-7 A CAT algorithm for generating permutations with a fixed number of inversions
Discrete Appl. Math. Ruskey 36 1 57 1992 10.1016/0166-218X(92)90204-N Generating permutations with given ups and downs
F. Ruskey, U. Taylor, Fast generation of restricted classes of permutations, Manuscript, 1995.
Comput. Surveys Sedgewick 9 2 137 1977 10.1145/356689.356692 Permutation generation methods
10.1017/CBO9780511805967 R. Stanley, Enumerative Combinatorics, vol. 1, Cambridge University Press, Cambridge, England, 1997.
Acta Inform. Vajnovszki 38 793 2002 10.1007/s00236-002-0097-0 Gray visiting Motzkins
Theoret. Comput. Sci. Vajnovszki 307 415 2003 10.1016/S0304-3975(03)00228-7 A loopless algorithm for generating the permutations of a multiset
J. Combin. Math. Combin. Comput. Walsh 36 95 2001 Gray code for involutions
Walsh vol. 2731 73 2003 Generating Gray codes in O(1) worst-case time per word
Wilson 2002 A Course in Combinatorics
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.