Abstract
In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for some classes of patterns and several other short patterns.
| Original language | English |
|---|---|
| Pages (from-to) | XXLV-XXLVI |
| Journal | Electronic Journal of Combinatorics |
| Volume | 9 |
| Issue number | 2 |
| State | Published - 2002 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics