| Autor: |
J.-L. Baril |
| Jazyk: |
angličtina |
| Rok vydání: |
2003 |
| Předmět: |
|
| Zdroj: |
Computer Science Journal of Moldova, Vol 11, Iss 2(32), Pp 124-136 (2003) |
| Druh dokumentu: |
article |
| ISSN: |
1561-4042 |
| Popis: |
A length-n Cayley permutation p of a total ordered set S is a length-n sequence of elements from S, subject to the condition that if an element x appears in p then all elements y < x also appear in p . In this paper, we give a Gray code list for the set of length-n Cayley permutations. Two successive permutations in this list differ at most in two positions. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
