Variable strength covering arrays
From MaRDI portal
Recommendations
- A construction of variable strength covering arrays
- Covering arrays of strength three
- Covering arrays of higher strength from permutation vectors
- Construction of mixed covering arrays of variable strength using a tabu search approach
- Resolvable covering arrays
- Covering arrays via set covers
- Cover starters for covering arrays of strength two
- Covering arrays, augmentation, and quilting arrays
- Tower of covering arrays
Cited in
(14)- A construction of variable strength covering arrays
- Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
- Consecutive detecting arrays for interaction faults
- Cost-efficient mixed-level covering designs for testing experiments
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Problems and algorithms for covering arrays via set covers
- A survey on the problems and algorithms for covering arrays via set covers
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- Mixed covering arrays on graphs of small treewidth
- A hyperedge coloring and application in combinatorial testing
- Ordered covering arrays and upper bounds on covering codes
- Covering array on the Cartesian product of hypergraphs
- A survey of cover-free families: constructions, applications, and generalizations
This page was built for publication: Variable strength covering arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556025)
