Pattern Matching for 321-Avoiding Permutations

DOI10.1007/978-3-642-10631-6_107zbMath1273.68422arXiv1511.01770OpenAlexW2229257002WikidataQ60638481 ScholiaQ60638481MaRDI QIDQ3652292

Sylvain Guillemot, Stéphane Vialette

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01770

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Algorithms on strings (68W32)

Related Items (10)

Order-preserving indexing ⋮ A fast algorithm for permutation pattern matching based on alternating runs ⋮ Labelled well-quasi-order for permutation classes ⋮ A linear time algorithm for consecutive permutation pattern matching ⋮ Parity permutation pattern matching ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Unnamed Item ⋮ Fillings of skew shapes avoiding diagonal patterns ⋮ Unnamed Item ⋮ Finding and counting permutations via CSPs

This page was built for publication: Pattern Matching for 321-Avoiding Permutations