Loopless generation of multiset permutations using a constant number of variables by prefix shifts

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 987-996

  Williams, Aaron ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

LOOPLESS; MULTISET; MULTISET PERMUTATION; PREFIX SHIFTS; SUBLINEAR;

ALGORITHMS;

EID: 70349084922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.107     Document Type: Conference Paper

References (36)

1. G. Betta A. Pietrosanto A. Scaglione. A Gray-code-based fiber optic liquid level transducer. IEEE Transactions on Instrumentation and Measurement, 47(1):174-178, February 1998.
2. F. Ruskey A. Williams. Generating combinations by prefix shifts. In COCOON '05: Computing and Combinatorics, 11th Annual International Conference, volume 3595 of Lecture Notes in Computer Science, Kunming, China, 2005. Springer-Verlag.
3. F. Ruskey A. Williams. The coolest way to generate combinations. Discrete Mathematics, (in press), 2008.
4. F. Ruskey A. Williams. An explicit universal cycle for the (n - 1)-permutations of an n-set. ACM Transactions on Algorithms, (submitted), 2008.
5. F. Ruskey A. Williams. Generating balanced parentheses and binary trees by prefix shifts. In CATS '08: Fourteenth Computing: The Australasian Theory Symposium, volume 77 of CRPIT, Wollongong, Australia, 2008. ACS.
6. T.M.Y. Wang C. Savage. A Gray code for necklaces of fixed density. SIAM Journal on Discrete Mathematics, 9(4):654-673, 1996. (Pubitemid 126556984)
7. C. W. Ko F. Ruskey. Generating permutations of a bag by interchanges. Information Processing Letters, 41:263-269, 1992.
8. G. Pruesse F. Ruskey. Generating linear extensions fast. SIAM Journal on Computing, 23(2):373-386, April 1994.
9. M. Jiang F. Ruskey. Determining the Hamilton-connectedness of certain vertex-transitive graphs. Discrete Mathematics, 133:159-170, 1994.
10. F. Ruskey J. Sawada. An efficient algorithm for generating necklaces with fixed density. In SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on discrete algorithms, pages 729-758, Baltimore, Maryland, United States, 1999. Society for Indusstrial and Applied Mathematics.
11. F. Ruskey J. Sawada. An efficient algorithm for generating necklaces with fixed density. SIAM Journal of Computing, 29(2):671-684, 1999. (Pubitemid 30860979)
12. F. Ruskey J. Sawada. A fast algorithm to generate unlabeled necklaces. In SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on discrete algorithms, pages 256-262, San Francisco, California, United States, 2000. Society for Indusstrial and Applied Mathematics.
13. V. Vajnovszki M. Weston. Gray codes for necklaces and lyndon words of arbitrary base. Pure Mathematics and Applications/Algebra and Theoretical Computer Science, 17(1-2):175-182, 2006.
14. F. Chung P. Diaconis R. Graham. Universal cycles for combinatorial structures. Discrete Mathematics, 110, 1992.
15. J. F. Korsh P. S. LaFollette. Loopless generation of linear extensions of a poset. Order, 18(2):115-126, 2002. (Pubitemid 37134185)
16. J. F. Korsh P. S. LaFollette. Loopless array generation of multiset permutations. The Computer Journal, 47(5):612-621, 2004.
17. E. R. Canfield S. G. Williamson. A loop-free algorithm for generating the linear extensions of a poset. Order, 12(1):57-75, 1995.
18. P. Diaconis S. Holmes. Gray codes for randomization procedures. Statistical Computing, 4:207-302, 1994.
19. J. F. Korsh S. Lipschutz. Generating multiset per-mutations in constant time. Journal of Algorithms, 25:321-335, 1997. (Pubitemid 127451768)
20. R. Sawae T. Sakata M. Tei K. Takarabe Y. Manmoto. Gray code and the initialization problem of NMR quantum computers. International Journal of Quantum Chemistry, 95:558-560, 2003.
21. P. F. Corbett. Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Transactions on Parallel and Distributed Systems, 3:622-626, 1992. (Pubitemid 23556067)
22. N.G. de Bruijn. A combinatorial problem. Koninkl. Nederl. Acad. Wetensch. Proc. Ser A, 49:758-764, 1946.
23. G. Ehrlich. Loopless algorithms for generating permutations, combinations and other combinatorial configurations. Journal of the ACM, 20:500-513, 1973.
24. F. Gray. Pulse code communication. U.S. Patent 2,632,058, 1947.
25. J. R. Johnson. Universal cycles for permutations. Discrete Mathematics, (in press), 2008.
26. S. M. Johnson. Generation of permutations by adjacent transpositions. Mathematics of Computation, 17:282-285, 1963.
27. D. E. Knuth. The Art of Computer Programming, volume 4 fasicle 3 - Generating All Combinations and Partitions. Updated 10/02/2008.
28. D. E. Knuth. The Art of Computer Programming, volume 4 fasicle 2 - Generating All Tuples and Permutations. Updated 10/02/2008.
29. D. E. Knuth. The Art of Computer Programming, volume 4 fasicle 4 - Generating All Trees. Updated 10/02/2008.
30. F. Ruskey. Generating linear extensions of posets by transpositions. Journal of Combinatorial Theory (B), 54:77-101, 1992.
31. C. Savage. A survey of combinatorial Gray codes. SIAM Review, 39(4):605-629, 1997.
32. J. Sawada. A fast algorithm to generate necklaces with fixed-content. Theoretical Computer Science, 1-3(301):477-489, 2003.
33. T. Takaoka. An O(1) time algorithm for generating multiset permutations. In ISAAC '99: Algorithms and Computation, 10th International Symposium, volume 1741 of Lecture Notes in Computer Science, pages 237-246, Chennai, India, 1999. Springer.
34. T. Ueda. Gray codes for necklaces. Discrete Mathematics, 219(1-3):235-248, 2000.
35. V. Vajnovszki. A loopless algorithm for generating the permutations of a multiset. Theoretical Computer Science, 2(307):415-431, 2003.
36. V. Vajnovszki. More restrictive Gray codes for necklaces and Lyndon words. Information Processing Letters, 106(3):96-99, 2008. (Pubitemid 351329294)