ISAAC 2009: Algorithms and Computation pp 1064-1073

Pattern Matching for 321-Avoiding Permutations

  • Sylvain Guillemot
  • Stéphane Vialette
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5878)

Abstract

Given two permutations π and σ, the NP-complete Permutation Pattern problem is to decide whether π contains σ as a pattern. In case both π and σ are 321-avoiding, we prove the Permutation Pattern problem to be solvable in O(k2n6) time, where k = |σ| and n = |π|, and give a \(O(kn^{4\sqrt{k}+12})\) time algorithm if only σ is 321-avoiding. Finally, we show W[1]-hardness of a 2-colored version of this latter problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sylvain Guillemot
    • 1
  • Stéphane Vialette
    • 1
  1. 1.LIGMCNRS UMR 8049, Université Paris-Est 

Personalised recommendations