From Linear Partitions to Parallelogram Polyominoes

DOI10.1007/978-3-642-22321-1_30zbMath1221.05034OpenAlexW6455561MaRDI QIDQ5199979

Paolo Massazza, Roberto Mantaci

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_30

zbMATH Keywords

polyominoesCAT algorithmsexhaustive generation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Polyominoes (05B50)

Related Items (7)

An efficient algorithm for generating symmetric ice piles ⋮ Parallel and sequential dynamics of two discrete models of signed integer partitions ⋮ On the exhaustive generation of plane partitions ⋮ From Tetris to polyominoes generation ⋮ Partially directed animals with a bounded number of holes ⋮ A Dynamical System Approach to Polyominoes Generation* ⋮ On the generation of convex polyominoes

This page was built for publication: From Linear Partitions to Parallelogram Polyominoes