메뉴 건너뛰기
Discrete Mathematics
Volumn 309, Issue 17, 2009, Pages 5264-5270
Universal cycles for permutations
Author keywords

Combinatorial generation; Permutations; Universal cycles
Indexed keywords

COMBINATORIAL GENERATION; PERMUTATIONS; RELATIVE ORDER; UNIVERSAL CYCLES;
EID: 68049111436     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.11.004     Document Type: Article
Times cited : (52)
References (4)
  • 1
    • 33747128854 scopus 로고
    • Universal cycles for combinatorial structures
    • Chung F., Diaconis P., and Graham R. Universal cycles for combinatorial structures. Discrete Math. 110 (1993) 43-59
    • (1993) Discrete Math. , vol.110 , pp. 43-59
    • Chung, F.1    Diaconis, P.2    Graham, R.3
  • 3
    • 38249001278 scopus 로고
    • Universal cycles for k-subsets and k-permutations
    • Jackson B.W. Universal cycles for k-subsets and k-permutations. Discrete Math. 117 (1993) 141-150
    • (1993) Discrete Math. , vol.117 , pp. 141-150
    • Jackson, B.W.1
  • 4
    • 68049083178 scopus 로고    scopus 로고
    • Shorthand universal cycles for permutations
    • submitted for publication
    • A.M. Williams, Shorthand universal cycles for permutations, in: ACM-SIAM Symposium on Discrete Algorithms 2008, 2007 (submitted for publication)
    • (2007) ACM-SIAM Symposium on Discrete Algorithms
    • Williams, A.M.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.