COCOON
2010
Springer
13 years 9 months ago
2010
Springer
A universal cycle for the k-permutations of n = {1, 2, ..., n} is a circular string of length nk that contains each k-permutation exactly once as a substring. Jackson (Discrete Mat...