The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations

zbMath1400.05003arXiv1510.06051MaRDI QIDQ4557004

Martin Lackner, Marie-Louise Lackner, Michael Henry Albert, Vincent R. Vatter

Publication date: 28 November 2018

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

zbMATH Keywords

combinatoricsalgorithmsdata structurescomputer sciencepermutation patternpermutation class

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Algorithms on strings (68W32)

Related Items (8)

Labelled well-quasi-order for permutation classes ⋮ Prolific permutations ⋮ Parity permutation pattern matching ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ On permutations avoiding partially ordered patterns defined by bipartite graphs ⋮ Unnamed Item ⋮ Two examples of Wilf-collapse ⋮ Finding and counting permutations via CSPs

This page was built for publication: The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations