34 search results - page 1 / 7 » Longest Common Separable Pattern between Permutations |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
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 pe...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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 separable. We also give an algorithm...
CPM
2007
Springer
13 years 11 months ago
2007
Springer
DAM
2006
13 years 4 months ago
2006
A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter per...
CPM
2009
Springer
13 years 11 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...