Variable strength covering arrays

DOI10.1002/jcd.21602zbMath1402.05023OpenAlexW4246412311MaRDI QIDQ4556025

Brett Stevens, Lucia Moura, Sebastian Raaphorst

Publication date: 23 November 2018

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10393/23684

zbMATH Keywords

hypergraphhomomorphismcovering arrayabstract simplicial complex

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

Mixed covering arrays on graphs of small treewidth, A hyperedge coloring and application in combinatorial testing, A construction for strength-3 covering arrays from linear feedback shift register sequences, Ordered covering arrays and upper bounds on covering codes, Consecutive detecting arrays for interaction faults, A construction of variable strength covering arrays, Cost-efficient mixed-level covering designs for testing experiments, Arrays for combinatorial interaction testing: a review on constructive approaches, Problems and algorithms for covering arrays via set covers, A survey on the problems and algorithms for covering arrays via set covers, Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma