Covering arrays with mixed alphabet sizes
From MaRDI portal
Publication:4452472
DOI10.1002/jcd.10059zbMath1031.05027OpenAlexW2081479998MaRDI QIDQ4452472
No author found.
Publication date: 12 February 2004
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.10059
orthogonal arraysoftware testingtransversal designfactorial designcovering arraymixed covering arraynetwork testing
Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)
Related Items (17)
Problems and algorithms for covering arrays ⋮ 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 on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ Optimum mixed level detecting arrays ⋮ Covering array EXtender ⋮ Mixed covering arrays of strength three with few factors ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ Bipartite locating array ⋮ Cost-efficient mixed-level covering designs for testing experiments ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Generalized covering designs and clique coverings ⋮ Cover starters for covering arrays of strength two ⋮ Covering arrays avoiding forbidden edges ⋮ Covering arrays on graphs
Cites Work
This page was built for publication: Covering arrays with mixed alphabet sizes
