scientific article
From MaRDI portal
Publication:2721325
zbMath0979.68046MaRDI QIDQ2721325
No author found.
Publication date: 19 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (14)
A loopless algorithm for generating the permutations of a multiset ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ Gray code for permutations with a fixed number of cycles ⋮ Optimal Gray code for involutions ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Generating restricted classes of involutions, Bell and Stirling permutations ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Gray codes for signed involutions ⋮ A general exhaustive generation algorithm for Gray structures ⋮ Gray code for derangements ⋮ Gray codes, loopless algorithm and partitions ⋮ The coolest way to generate combinations
This page was built for publication:
