On the exhaustive generation of convex permutominoes
Combinatorics
2008-10-17 v1
Abstract
A 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.
Cite
@article{arxiv.0810.2883,
title = {On the exhaustive generation of convex permutominoes},
author = {Elisabetta Grazzini and Elisa Pergola and Maddalena Poneti},
journal= {arXiv preprint arXiv:0810.2883},
year = {2008}
}
Comments
15 pages, 14 figures