scientific article; zbMATH DE number 553907

zbMATH Open0802.68091MaRDI QIDQ4288077FDOQ4288077

Authors: Dominique Roelants van Baronaigien, Frank Ruskey 

Publication date: 21 April 1994

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

Recommendations

• Publication:4863420
• scientific article; zbMATH DE number 559036
• scientific article; zbMATH DE number 3917730
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Subset-sum problems with different summands: Computation

zbMATH Keywords

recursive algorithmscomputational combinatorics

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)

Cited In (7)

• An efficient Gray code algorithm for generating all permutations with a given major index
• Title not available (Why is that?)
• On the effective generation of set elements within specified ranges
• Gray codes for Fibonacci \(q\)-decreasing words
• Title not available (Why is that?)
• Generating all subsets of a finite set with disjoint unions
• Generating subsets on a systolic array

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 Q4288077)