Sequence Covering Arrays

DOI10.1137/120894099zbMath1292.05079OpenAlexW2139690594MaRDI QIDQ5408596

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (11)

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

This page was built for publication: Sequence Covering Arrays