Covering arrays of higher strength from permutation vectors
By G. B. Sherwood, Sosina Martirosyan, Charles J. Colbourn. 2006
60 citations recorded by the source corpus.
Subfields: Electrical and Electronic Engineering, Hardware and Architecture, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/15ebc9b5c6d808d7326c609cf50e54b438287874
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Electrical and Electronic Engineering
In Hardware and Architecture
In Management Science and Operations Research
Citations in the corpus
- A survey of combinatorial testing (2011, methodology): “This group discussed two algebraic approaches to generate covering array, which could be used to build mixed covering array of strength 2 and covering array of higher strength [Colbourn et al. 2005; Bryce and Colbourn 2005; Sherwood et al. 2005; Bryce et al. 2005], and introduced several greedy algo”
- Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory (2007, background): “ay and Zk is its alphabet. For most applications, it is desirable to have covering arrays with smallest possible size. Much of the work on covering arrays focuses on developing constructions for them [21, 49, 65, 71], finding bounds on their minimum size [70] and more recently, on improving heuristic”