On the exhaustive generation of \(k\)-convex polyominoes (Q517034)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the exhaustive generation of \(k\)-convex polyominoes |
scientific article; zbMATH DE number 6695323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the exhaustive generation of \(k\)-convex polyominoes |
scientific article; zbMATH DE number 6695323 |
Statements
On the exhaustive generation of \(k\)-convex polyominoes (English)
0 references
16 March 2017
0 references
convex polyominoes
0 references
exhaustive generation
0 references
CAT algorithms
0 references
0.95271665
0 references
0.9436823
0 references
0.9196714
0 references
0.9066266
0 references
0 references
0 references
0 references
0.8883475
0 references
