Generating combinations by prefix shifts

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 570-576

  Ruskey, Frank ^a   Williams, Aaron ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; ARTIFICIAL INTELLIGENCE; COMPUTERS;

BITSTRINGS; PREFIX SHIFTS; TRANSPOSING; BIT-STRINGS; GRAY CODES; LOOPLESS; RANKING ALGORITHM;

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS;

EID: 26844519222     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_58     Document Type: Conference Paper

References (11)

1. P.F. Corbett, Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks, IEEE Transactions on Parallel and Distributed Systems, 3 (1992) 622-626
2. P.J. Chase, Combination Generation and Graylex Ordering, Congressus Numerantium, 69 (1989) 215-242.
3. P. Diaconis and S. Holmes, Gray codes for randomization procedures, Statistical Computing, 4 (1994) 207-302.
4. P. Eades, M. Hickey and R. Read, Some Hamilton Paths and a Minimal Change Algorithm, Journal of the ACM, 31 (1984) 19-29.
5. P. Eades and B. McKay, An Algorithm for Generating Subsets of Fixed Size with a Strong Minimal Change Property, Information Processing Letters, 19 (1984) 131-133.
6. G. Ehrlich, Loopless Algorithms for Generating Permutations, Combinations and Other Combinatorial Configurations, Journal of the ACM, 20 (1973) 500-513.
7. M. Jiang and F. Ruskey, Determining the Hamilton-connectedness of certain vertex-transitive graphs, Discrete Mathematics, 133 (1994) 159-170.
8. Donald E. Knuth, The Art of Computer Programming, pre-fascicle 4A (a draft of Section 7.2.1.3: Generating all Combinations), Addison-Wesley, 2004, 61 pages (http://www-cs-faculty.stanford.edu/~knuth/fasc3a.ps.gz).
9. F. Ruskey, Simple combinatorial Gray codes constructed by reversing sublists, 4th ISAAC (International Symposium on Algorithms and Computation), Lecture Notes in Computer Science, #762 (1993) 201-208.
10. D.T. Tang and C.N. Liu Distance-2 Cycle Chaining of Constant Weight Codes, IEEE Transactions, C-22 (1973) 176-180.
11. D. Stanton and D. White, Constructive Combinatorics, Springer-Verlag, 1986.