scientific article; zbMATH DE number 731846
From MaRDI portal
Publication:4325282
Recommendations
Cited in
(18)- Gray codes for non-crossing partitions and dissections of a convex polygon
- Gray codes, loopless algorithm and partitions
- A Gray code for set partitions
- Gray code enumeration of families of integer partitions
- A Gray code for combinations of a multiset
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
- More restricted growth functions: Gray codes and exhaustive generation
- Efficient generation of restricted growth words
- Gray code sequences of partitions
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Gray codes for noncrossing and nonnesting partitions of classical types
- Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
- Motor insurance claim modelling with factor collapsing and Bayesian model averaging
- Loop-free Gray code algorithms for the set of compositions
- Last symbol distribution in pattern avoiding Catalan words
- Maximize the rightmost digit: Gray codes for restricted growth strings
- Gray codes for reflectable languages
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 Q4325282)