scientific article; zbMATH DE number 1354135
From MaRDI portal
Publication:4268449
zbMath0925.94101MaRDI QIDQ4268449
Publication date: 31 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
A loopless algorithm for generating the permutations of a multiset ⋮ An Eades-McKay algorithm for well-formed parentheses strings ⋮ A trace partitioned Gray code forq-ary generalized Fibonacci strings ⋮ Gray codes for Fibonacci \(q\)-decreasing words ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ Gray code for permutations with a fixed number of cycles ⋮ Counting and computing the Rand and block distances of pairs of set partitions ⋮ Efficient generation of restricted growth words ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Gray code enumeration of plane straight-line graphs ⋮ The rotation graph of \(k\)-ary trees is Hamiltonian ⋮ Gray code for derangements ⋮ The coolest way to generate combinations ⋮ A new algorithm for optimal 2-constraint satisfaction and its implications
This page was built for publication:
