Generating permutations of a bag by interchanges

DOI10.1016/0020-0190(92)90170-ZMaRDI QIDQ1197979zbMATH OpenFDO

Authors Chun Wa Ko, Frank Ruskey

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

permutationsalgorithmsbaginterchange

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3557795
• A new algorithm for generation of permutations
• Adjacent interchange generation of combinations
• scientific article; zbMATH DE number 2216957
• Generating permutations with given ups and downs

Cites work

• scientific article; zbMATH DE number 3864523 (Why is no real title available?)
• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3573251 (Why is no real title available?)
• Efficient generation of the binary reflected gray code and its applications
• Generating Permutations with Nondistinct Items
• More permutation generation methods
• On Rotations and the Generation of Binary Trees

Cited in

(6)

• Loop-free Gray code algorithms for the set of compositions
• A loopless algorithm for generating the permutations of a multiset
• Gray codes, loopless algorithm and partitions
• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
• Gray code for derangements
• Combinatorial Gray codes for classes of pattern avoiding permutations

This page was built for publication: Generating permutations of a bag by interchanges

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