scientific article; zbMATH DE number 2081004
From MaRDI portal
Publication:4474102
zbMath1077.68720MaRDI QIDQ4474102
M. D. Atkinson, R. E. L. Aldred, Derek Holton, Michael Henry Albert
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230355.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)
Related Items (12)
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth ⋮ On the least exponential growth admitting uncountably many closed permutation classes ⋮ Order-preserving indexing ⋮ A fast algorithm for permutation pattern matching based on alternating runs ⋮ A linear time algorithm for consecutive permutation pattern matching ⋮ Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations ⋮ Algorithms for testing occurrences of length 4 patterns in permutations ⋮ Unnamed Item ⋮ On the sub-permutations of pattern avoiding permutations ⋮ An algorithm for deciding the finiteness of the number of simple permutations in permutation classes ⋮ Unnamed Item ⋮ Finding and counting permutations via CSPs
This page was built for publication:
