Generating permutations of a bag by interchanges

DOI10.1016/0020-0190(92)90170-ZzbMath0764.68103MaRDI QIDQ1197979

Frank Ruskey, Chun Wa Ko

Publication date: 16 January 1993

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

zbMATH Keywords

permutationsalgorithmsbaginterchange

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

• More permutation generation methods
• Efficient generation of the binary reflected gray code and its applications
• Generating Permutations with Nondistinct Items
• On Rotations and the Generation of Binary Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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