Sequence covering arrays

DOI10.1137/120894099MaRDI QIDQ5408596zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley, Junling Zhou

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

zbMATH Keywords

sequence covering arraycompletely scrambling set of permutationsdirected \(t\)-design

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Sequence Covering Arrays and Linear Extensions
• Perfect sequence covering arrays
• scientific article; zbMATH DE number 861356

Cited in

(14)

• Perfect sequence covering arrays
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Sequence Covering Arrays and Linear Extensions
• Covering arrays from \(m\)-sequences and character sums
• Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
• The covering threshold of a directed acyclic graph by directed acyclic subgraphs
• A group-based structure for perfect sequence covering arrays
• Growth of the perfect sequence covering array number
• On perfect sequence covering arrays
• Subsequence covers of words
• Covering arrays with mixed alphabet sizes
• A polynomial construction of perfect sequence covering arrays
• Perfect and nearly perfect separation dimension of complete and random graphs
• Separation dimension of graphs and hypergraphs

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)