scientific article; zbMATH DE number 2040945

MaRDI QIDQ4452096zbMATH OpenFDO

Authors S. Rinaldi, A. Del Lungo, Andrea Frosini

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2731/27310129.htm

Mathematics Subject Classification ID

Polyominoes (05B50) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• On the generation and enumeration of some classes of convex polyominoes
• scientific article; zbMATH DE number 2046044
• From object grammars to ECO systems
• On the generation of convex polyominoes
• On the exhaustive generation of \(k\)-convex polyominoes

Cited in

(12)

• Production matrices
• On the generation and enumeration of some classes of convex polyominoes
• From object grammars to ECO systems
• Exhaustive generation of combinatorial objects by ECO
• Efficient iteration in admissible combinatorial classes
• scientific article; zbMATH DE number 2046044 (Why is no real title available?)
• ECO-generation for some restricted classes of compositions
• A Dynamical System Approach to Polyominoes Generation*
• On the exhaustive generation of \(k\)-convex polyominoes
• ECO method and hill-free generalized Motzkin paths
• Production matrices and riordan arrays
• Efficient counting of k-convex polyominoes

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 Q4452096)