A fast algorithm for permutation pattern matching based on alternating runs (Q300457)

From MaRDI portal
Revision as of 05:31, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6065675
  • A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
Language Label Description Also known as
English
A fast algorithm for permutation pattern matching based on alternating runs
scientific article; zbMATH DE number 6065675
  • A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs

Statements

A fast algorithm for permutation pattern matching based on alternating runs (English)
0 references
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs (English)
0 references
0 references
0 references
28 June 2016
0 references
14 August 2012
0 references
permutation patterns
0 references
parameterized complexity
0 references
pattern matching
0 references
fixed-parameter tractability
0 references
exponential algorithms
0 references
combinatorics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references