Covering arrays with mixed alphabet sizes
From MaRDI portal
Publication:4452472
Recommendations
- Covering arrays via set covers
- Algorithmic methods for covering arrays of higher index
- Problems and algorithms for covering arrays
- Covering arrays and intersecting codes
- Upper bounds on the size of covering arrays
- Covering arrays for some equivalence classes of words
- scientific article; zbMATH DE number 5177325
- Sequence covering arrays
- Covering arrays and hash families
- Algebraic techniques for covering arrays and related structures
Cited in
(19)- Optimum mixed level detecting arrays
- Cost-efficient mixed-level covering designs for testing experiments
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Covering arrays on graphs
- Optimal and near-optimal mixed covering arrays by column expansion
- Products of mixed covering arrays of strength two
- Cover starters for covering arrays of strength two
- Generalized covering designs and clique coverings
- The test suite generation problem: optimal instances and their implications
- Mixed covering arrays on graphs of small treewidth
- Lower bound and construction of mixed-level locating arrays
- Covering arrays avoiding forbidden edges
- Mixed covering arrays on 3-uniform hypergraphs
- Problems and algorithms for covering arrays
- Mixed covering arrays of strength three with few factors
- Mixed covering arrays on graphs
- Covering array EXtender
- Bipartite locating array
- Constructions of mixed covering arrays with strength \( \ge 3\)
This page was built for publication: Covering arrays with mixed alphabet sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452472)