Pattern matching for permutations
From MaRDI portal
Publication:5060113
DOI10.1007/3-540-57155-8_248zbMath1504.68150OpenAlexW1839802651MaRDI QIDQ5060113
Jonathan F. Buss, Anna Lubiw, Prosenjit Bose
Publication date: 18 January 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57155-8_248
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Finding pattern matchings for permutations ⋮ Permutations with one or two 132-subsequences ⋮ On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) ⋮ Order Preserving Pattern Matching on Trees and DAGs ⋮ Restricted permutations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complement reducible graphs
- Stack sortable permutations
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- A Linear Recognition Algorithm for Cographs
- Sorting Using Networks of Queues and Stacks
This page was built for publication: Pattern matching for permutations
