Covering arrays avoiding forbidden edges and edge clique covers
Covering arrays avoiding forbidden edges (CAFEs) are combinatorial designs which can be used to generate test suites for practical testing applications. CAFEs generate test suites in which all required pairwise interactions between any two factors are tested at least once each, with the property tha...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Ottawa (Canada)
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/28442 http://dx.doi.org/10.20381/ruor-19265 |