In this paper, we study the problem of finding the longest common separable pattern among several permutations. We first give a polynomial-time algorithm ...

Feb 5, 2007 · Abstract: In this article, we study the problem of finding the longest common separable pattern between several permutations.

In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when ...

In this paper, we study the problem of finding the longest common separable pattern among several permutations. We first give a polynomial-time algorithm ...

Feb 5, 2007 · In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time.

Pattern avoiding. A permutation σ that does not contain a permutation π as a pattern is said to avoid π. The set of all permutations avoiding the patterns ...

In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable.

Feb 5, 2007 · Notice that a longest common pattern between two permutations, one of them being separable, is always separable. In this section, we generalize ...

Mar 14, 2007 · In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is ...

In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable.