Longest Common Pattern between two Permutations
classification
🧮 math.CO
cs.DMcs.DS
keywords
permutationslongestalgorithmcommongivepatterncomplexitydepends
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.