On the exhaustive generation of convex permutominoes

Simple item page
dc.creatorGrazzini, Elisabetta
dc.creatorPergola, Elisa
dc.creatorPoneti, Maddalena
dc.date2008-10-16
dc.date.accessioned2026-07-07T10:10:38Z
dc.date.available2026-07-07T10:10:38Z
dc.descriptionA permutomino of size n is a polyomino determined by a pair of permutations of size n+1, such that they differ in each position. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the exhaustive generation of a particular class of permutominoes, the convex permutominoes, proving that its cost is proportional to the number of generated objects.
dc.description15 pages, 14 figures
dc.identifierhttps://arxiv.org/abs/0810.2883
dc.identifierhttp://arxiv.org/abs/0810.2883
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171653
dc.subjectCombinatorics
dc.subject05A05
dc.titleOn the exhaustive generation of convex permutominoes
dc.typetext

Files

Collections

arXiv