Publication:4268449
From MaRDI portal
zbMath0925.94101MaRDI QIDQ4268449
Publication date: 31 October 1999
94B25: Combinatorial codes
Related Items
An Eades-McKay algorithm for well-formed parentheses strings, Prefix partitioned Gray codes for particular cross-bifix-free sets, A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words, Gray code for permutations with a fixed number of cycles, Combinatorial Gray codes for classes of pattern avoiding permutations, The rotation graph of \(k\)-ary trees is Hamiltonian, The coolest way to generate combinations, Gray code for derangements, A loopless algorithm for generating the permutations of a multiset, Counting and computing the Rand and block distances of pairs of set partitions, Efficient generation of restricted growth words, Gray code enumeration of plane straight-line graphs, A new algorithm for optimal 2-constraint satisfaction and its implications