다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Discrete applied mathematics, v.140 no.1/3, 2004년, pp.207 - 221
Baril, Jean-Luc (LE2I-UMR CNRS 5158, Université) , Vajnovszki, Vincent (de Bourgogne, B.P. 47 870, 21078 Dijon Cedex, France)
AI-Helper
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results...
BIT Akl 20 2 1980 10.1007/BF01933579 A new algorithm for generating derangements
Akl 1989 The Design and Analysis of Parallel Algorithms
Congr. Numer. Chase 69 215 1989 Combination generation and graylex ordering
Comtet 1974 Advanced Combinatorics: The Art of Finite and Infinite Expansions
IPL Eades 19 131 1984 10.1016/0020-0190(84)90091-7 An algorithm for generating subsets of fixed size with a strong minimal change property
Inform. Process. Lett. Effler 86 2 107 2003 10.1016/S0020-0190(02)00481-7 A CAT algorithm for generating permutations with a fixed number of inversions
D.E. Knuth, The Art of Computer Programming, Combinatorial Algorithms, Vol. 4. Pre-fascicle 2b (Generating all permutations), http://www-cs-staff.Stanford.EDU/knuth/taocp.html# vol4,2002.
IPL Ko 41 5 263 1992 10.1016/0020-0190(92)90170-Z Generating permutations of a bag by interchanges
Discrete Math. Korsh 240 1-3 97 2001 10.1016/S0012-365X(00)00387-3 Loopless generation of up-down permutations
J. Korsh, P.S. LaFollette, Constant time generation of derangements, Department Technical Report, Temple University CIS, December 2002.
Discrete Appl. Math. Roelants van Baronaigien 36 1 57 1992 10.1016/0166-218X(92)90204-N Generating permutations with given ups and downs
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.
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
10.1016/S0304-3975(03)00228-7 V. Vajnovszki, A loopless algorithm for generating the permutations of a multiset, TCS, 307 (2003) 415-431.
J. Combin. Math. Combin. Comput. Walsh 33 323 2000 Loop-free sequencing of bounded integer compositions
J. Combin. Math. Combin. Comput. Walsh 36 95 2001 Gray codes for involutions
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 APC(Article Processing Charge)를 지불한 논문에 한하여 자유로운 이용이 가능한, hybrid 저널에 출판된 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.