2000 character limit reached
Longest Common Pattern between two Permutations
Published 22 Nov 2006 in math.CO, cs.DM, and cs.DS | (0611679v1)
Abstract: 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 for general permutations whose complexity depends on the length of the longest simple permutation involved in one of our permutations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.