Sequence covering arrays
DOI10.1137/120894099zbMATH Open1292.05079OpenAlexW2139690594MaRDI QIDQ5408596FDOQ5408596
Junling Zhou, Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley
Publication date: 10 April 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ca696175981c5bb524773a3318569fef9835fe2d
Recommendations
Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)
Cited In (14)
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs
- Covering arrays with mixed alphabet sizes
- Separation dimension of graphs and hypergraphs
- On perfect sequence covering arrays
- Perfect and nearly perfect separation dimension of complete and random graphs
- Subsequence covers of words
- Covering arrays from \(m\)-sequences and character sums
- Perfect sequence covering arrays
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
- A group-based structure for perfect sequence covering arrays
- Growth of the perfect sequence covering array number
- A polynomial construction of perfect sequence covering arrays
- Sequence Covering Arrays and Linear Extensions
This page was built for publication: Sequence covering arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408596)