Pages that link to "Item:Q4452472"
From MaRDI portal
The following pages link to Covering arrays with mixed alphabet sizes (Q4452472):
Displaying 17 items.
- Optimum mixed level detecting arrays (Q464194) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Optimal and near-optimal mixed covering arrays by column expansion (Q998340) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Problems and algorithms for covering arrays (Q1876683) (← links)
- Covering array EXtender (Q2242769) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Bipartite locating array (Q2287790) (← links)
- Cost-efficient mixed-level covering designs for testing experiments (Q2301219) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- The test suite generation problem: optimal instances and their implications (Q2381816) (← links)
- Covering arrays on product graphs (Q2409504) (← links)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- Mixed covering arrays on graphs of small treewidth (Q5063252) (← links)
- Lower bound and construction of mixed-level locating arrays (Q5079084) (← links)