1,736 research outputs found
Longest Common Separable Pattern between 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
the number of input permutations is fixed and show that the problem is NP-hard
for an arbitrary number of input permutations even if these permutations are
separable. On the other hand, we show that the NP-hard problem of finding the
longest common pattern between two permutations cannot be approximated better
than within a ratio of (where is the size of an optimal
solution) when taking common patterns belonging to pattern-avoiding classes of
permutations.Comment: 15 page
Longest Common Pattern between two Permutations
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.
We also give an algorithm for general permutations whose complexity depends on
the length of the longest simple permutation involved in one of our
permutations
The Longest Common Pattern Problem for two Permutations
International audienceIn 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. We also give an algorithm for general permutations whose complexity depends on the length of the longest simple permutation involved in one of our permutations
- …