A linear time algorithm for consecutive permutation pattern matching
Authors:
- M. KubicaMKM. Kubica
- T. KulczyńskiTKT. Kulczyński
- J. RadoszewskiJRJ. Radoszewski
- W. RytterWRW. Rytter
- T. WaleńTWT. Waleń
- 1 June 2013
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 113 (12) , 430-433
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On Complexity of the Subpattern ProblemSIAM Journal on Discrete Mathematics, 2008
- Permutations avoiding consecutive patterns, IIArchiv der Mathematik, 2005
- Consecutive patterns in permutationsAdvances in Applied Mathematics, 2003
- Pattern matching for permutationsInformation Processing Letters, 1998
- Finding pattern matchings for permutationsInformation Processing Letters, 1997
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphsInformation Processing Letters, 1992
- Stack sortable permutationsDiscrete Mathematics, 1981