DeepAI AI Chat
Log In Sign Up

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes

by   Vít Jelínek, et al.
Charles University in Prague

Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed that PPM is NP-complete. In view of this result, it is natural to ask how the situation changes when we restrict the pattern P to a fixed permutation class C; this is known as the C-Pattern PPM problem. Grid classes are special kind of permutation classes, consisting of permutations admitting a grid-like decomposition into simpler building blocks. Of particular interest are the so-called monotone grid classes, in which each building block is a monotone sequence. Recently, it has been discovered that grid classes, especially the monotone ones, play a fundamental role in the understanding of the structure of general permutation classes. This motivates us to study the hardness of C-Pattern PPM for a (monotone) grid class C. We provide a complexity dichotomy for C-Pattern PPM when C is taken to be a monotone grid class. Specifically, we show that the problem is polynomial-time solvable if a certain graph associated with C, called the cell graph, is a forest, and it is NP-complete otherwise. We further generalize our results to grid classes whose blocks belong to classes of bounded grid-width. We show that the C-Pattern PPM for such a grid class C is polynomial-time solvable if the cell graph of C avoids a cycle or a certain special type of path, and it is NP-complete otherwise.


page 1

page 2

page 3

page 4


Griddings of permutations and hardness of pattern matching

We study the complexity of the decision problem known as Permutation Pat...

The complexity of decomposing a graph into a matching and a bounded linear forest

Deciding whether a graph can be edge-decomposed into a matching and a k-...

Long paths make pattern-counting hard, and deep trees make it harder

We study the counting problem known as #PPM, whose input is a pair of pe...

Faster Exponential Algorithm for Permutation Pattern Matching

The Permutation Pattern Matching problem asks, given two permutations σ ...

Matching Patterns with Variables

A pattern p (i.e., a string of variables and terminals) matches a word w...

On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...

Gourds: a sliding-block puzzle with turning

We propose a new kind of sliding-block puzzle, called Gourds, where the ...