most citedDeciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2010★ 1 cited

Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +1

We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutatio…