paper

Longest Common Pattern between two Permutations

arXiv:math/0611679 · doi:10.2140/agt.2007.7.829

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.

References in corpus (1)