most citedLongest Common Separable Pattern between Permutations

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2007★ 2 cited

Longest Common Separable Pattern between Permutations

Mathilde Bouvel, Dominique Rossin, Stephane Vialette

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 per…

math.CO2005

Edit Distance between Unlabeled Ordered Trees

Anne Micheli, Dominique Rossin

There exists a bijection between one stack sortable permutations --permutations which avoid the pattern 231-- and planar trees. We define an edit distance between permutations whic…