scientific article; zbMATH DE number 4106841

zbMATH Open0676.05003MaRDI QIDQ3831003FDOQ3831003

Authors: Tim Hough, Frank Ruskey 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• Adjacent interchange generation of combinations
• An optimal parallel algorithm for generating combinations
• An efficient algorithm for the generation of DeBruijn cycles
• A parallel algorithm for generating combinations
• A parallel algorithm for the generation of a permutation and applications
• A parallel derangement generation algorithm
• Efficient massively parallel implementation of some combinatorial algorithms
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• Algorithms and Computation

zbMATH Keywords

combination generation algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited In (5)

• A low spatial complexity algorithm to generate combinations with the strong minimal change property
• A new algorithm for generating combinations
• Generating alternating permutations lexicographically
• The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
• The coolest way to generate combinations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3831003)