An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Authors:
- Frédérique BassinoFBFrédérique Bassino
- Mathilde BouvelMBMathilde Bouvel
- Adeline PierrotAPAdeline Pierrot
- Dominique RossinDRDominique Rossin
- 1 March 2015
- journal article
- research article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 64, 124-200
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Agence Nationale de la Recherche (ANR BLAN-0204_07 MAGNUM)
This publication has 9 references indexed in Scilit:
- AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALSDiscrete Mathematics, Algorithms and Applications, 2011
- Enumeration of Pin-PermutationsThe Electronic Journal of Combinatorics, 2011
- Decomposing simple permutations, with enumerative consequencesCombinatorica, 2008
- Simple permutations and algebraic generating functionsJournal of Combinatorial Theory, Series A, 2008
- Simple permutations: Decidability and unavoidable substructuresTheoretical Computer Science, 2008
- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of GraphsSIAM Journal on Discrete Mathematics, 2008
- Simple permutations and pattern restricted permutationsDiscrete Mathematics, 2005
- Efficient string matchingCommunications of the ACM, 1975
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967