On the exhaustive generation of convex permutominoes

Details On the exhaustive generation of convex permutominoes On the exhaustive generation of convex permutominoes

2008-10-16

arxiv.org/abs/0810.2883v1

Mathematics

Combinatorics

15 pages, 14 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the exhaustive generation of convex permutominoes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the exhaustive generation of convex permutominoes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the exhaustive generation of convex permutominoes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367949