scientific article; zbMATH DE number 1354135
From MaRDI portal
Publication:4268449
Cited in
(14)- 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
- Gray codes for Fibonacci \(q\)-decreasing words
- 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
- An Eades-McKay algorithm for well-formed parentheses strings
- A trace partitioned Gray code forq-ary generalized Fibonacci strings
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268449)
