Shorthand universal cycles for permutations

Algorithmica

Volumn 64, Issue 2, 2012, Pages 215-245

  Holroyd, Alexander E ^a   Ruskey, Frank ^b   Williams, Aaron ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Algorithms; Cayley graphs; Gray codes; Permutohedron; Ucycles

Indexed keywords

BINARY REPRESENTATIONS; CAYLEY GRAPHS; ENCODINGS; GRAY CODES; LOOPLESS; MEMORYLESS; PERMUTOHEDRON; SPANNING TREE; SUB-STRINGS; UCYCLES; WILLIAMS;

ENCODING (SYMBOLS); GRAPH THEORY;

ALGORITHMS;

EID: 84864551591     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-011-9544-z     Document Type: Article

References (18)

1. Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discrete Math. 110, 43-59 (1992)
2. Compton, R.C.,Williamson, S.G.: Doubly adjacent Gray codes for the symmetric group. Linear Multilinear Algebra 35(3), 237-293 (1993)
3. Corbett, P.F.: Rotator graphs: An efficient topology for point-To-point multiprocessor networks. IEEE Trans. Parallel Distrib. Syst. 3, 622-626 (1992)
4. Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
5. Holroyd, A., Ruskey, F., Williams, A.: Faster generation of shorthand universal cycles for permutations. In: Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010), Nha Trang, Vietnam, July 19-21. LNCS, vol. 6196, pp. 298-307. Springer, Berlin (2010)
6. Jackson, B.: Universal cycles of k-subsets and k-permutations. Discrete Math. 149, 123-129 (1996)
7. Johnson, J.R.: Universal cycles for permutations. Discrete Math. 309, 5264-5270 (2009)
8. Johnson, S.M.: Generation of permutations by adjacent transpositions. Math. Comput. 17, 282-285 (1963)
9. Knuth, D.E.: The Art of Computer Programming, vol. 4, Generating All Tuples and Permutations, Fascicle 2. Addison-Wesley, Reading (2005)
10. Knuth, D.E.: The Art of Computer Programming, vols. 1-4A Boxed Set, 3rd edn. Addison-Wesley Professional, Reading (2011)
11. MacGregor, J.N., Ormerod, T.: Human performance on the traveling salesman problem. Percept. Psychophys. 58(4), 527-539 (1996)
12. Page, J., Salvia, J., Collewetb, C., Foresta, J.: Optimised De Bruijn patterns for one-shot shape acquisition. Image Vis. Comput. 23, 707-720 (2005)
13. Ruskey, F., Williams, A.: An explicit universal cycle for the (n-1)-permutations of an n-set. ACM Trans. Algorithms 6(3), article 45 (2010)
14. Scheinerman, E.R.: Determining planar location via complement-free de Brujin sequences using discrete optical sensors. IEEE Trans. Robot. Autom. 17(6), 883-889 (2001)
15. Sedgewick, R.: Permutation generation methods. Comput. Surv. 9, 137-164 (1977)
16. Sohn, H.S., Bricker, D.L., Simon, J.R., Hsieh, Y.C.: Optimal sequences of trials for balancing practice and repetition effects. Behav. Res. Methods Instrum. Comput. 29, 574-581 (1997)
17. Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, pp. 987-996 (2009)
18. Williams, A.: Shift gray codes, PhD Thesis, University of Victoria (2009)