Enumeration of factorizable multi-dimensional permutations.
Zhang, Hao, Gildea, Daniel (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Zhang, Hao, Gildea, Daniel (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Barcucci, Elena, Del Lungo, Alberto, Pergola, Elisa, Pinzani, Renzo (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Bóna, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vatter, Vincent R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lewis, Joel Brewster (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chebikin, Denis (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Marinov, Darko, Radoičić, Radoš (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anne Micheli, Dominique Rossin (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern ) and rooted plane trees. We define an edit distance between permutations which is consistent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...
Bóna, Miklós (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bousquet-Mélou, Mireille (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Deutsch, Emeric, Hildebrand, A.J., Wilf, Herbert S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: