Locating one pairwise interaction: three recursive constructions
From MaRDI portal
Partitions of sets (05A18) Triple systems (05B07) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial optimization (90C27)
Recommendations
Cites work
- Constructing strength three covering arrays with augmented annealing
- Cyclic difference packing and covering arrays.
- Locating and detecting arrays for interaction faults
- Locating errors using ELAs, covering arrays, and adaptive testing algorithms
- On the state of strength-three covering arrays
- Optimal locating arrays for at most two faults
- Optimality and constructions of locating arrays
- Products of mixed covering arrays of strength two
- Roux-type constructions for covering arrays of strengths three and four
- Software and hardware testing using combinatorial covering suites
Cited in
(14)- On a combinatorial framework for fault characterization
- Separating interaction effects using locating and detecting arrays
- Bipartite locating array
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Optimality and constructions of locating arrays
- Locating and detecting arrays for interaction faults
- Disjoint spread systems and fault location
- Expected time to detection of interaction faults
- Locating errors using ELAs, covering arrays, and adaptive testing algorithms
- Optimal locating arrays for at most two faults
- Lower bound and construction of mixed-level locating arrays
- Finding minimum locating arrays using a CSP solver
- Algorithms to Locate Errors Using Covering Arrays
- Mixed-level covering, locating, and detecting arrays via cyclotomy
This page was built for publication: Locating one pairwise interaction: three recursive constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241120)
