TY - JOUR
T1 - Mixed covering arrays on graphs of small treewidth
AU - Maity, Soumen
AU - Colbourn, Charles J.
N1 - Publisher Copyright:
© 2021 World Scientific Publishing Company.
PY - 2021
Y1 - 2021
N2 - Covering arrays are combinatorial objects that have been successfully applied in design of test suites for testing systems such as software, hardware, and networks where failures can be caused by the interaction between their parameters. Let n and k be positive integers with k ≥ 3. Two vectors x ∈ Zng1 and y ∈ Zng2 are qualitatively independent if for any ordered pair (a,b) ∈ Zg1 × Zg2, there exists an index j ∈ {0, 1,.,n-1} such that (x(j),y(j)) = (a,b). Let G be a graph with k vertices v1,v2,.,vk with respective vertex weights g1,g2,.,gk. A mixed covering array onG, denoted by CA(n,G, Πki=1kg i), is a k × n array such that row i corresponds to vertex vi, entries in row i are from Zgi; and if {vx,vy} is an edge in G, then the rows x,y are qualitatively independent. The parameter n is the size of the array. Given a weighted graph G, a mixed covering array on G with minimum size is optimal. In this paper, we introduce some basic graph operations to provide constructions for optimal mixed covering arrays on the family of graphs with treewidth at most three.
AB - Covering arrays are combinatorial objects that have been successfully applied in design of test suites for testing systems such as software, hardware, and networks where failures can be caused by the interaction between their parameters. Let n and k be positive integers with k ≥ 3. Two vectors x ∈ Zng1 and y ∈ Zng2 are qualitatively independent if for any ordered pair (a,b) ∈ Zg1 × Zg2, there exists an index j ∈ {0, 1,.,n-1} such that (x(j),y(j)) = (a,b). Let G be a graph with k vertices v1,v2,.,vk with respective vertex weights g1,g2,.,gk. A mixed covering array onG, denoted by CA(n,G, Πki=1kg i), is a k × n array such that row i corresponds to vertex vi, entries in row i are from Zgi; and if {vx,vy} is an edge in G, then the rows x,y are qualitatively independent. The parameter n is the size of the array. Given a weighted graph G, a mixed covering array on G with minimum size is optimal. In this paper, we introduce some basic graph operations to provide constructions for optimal mixed covering arrays on the family of graphs with treewidth at most three.
KW - Covering arrays
KW - edge cover
KW - matching
UR - http://www.scopus.com/inward/record.url?scp=85103947461&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85103947461&partnerID=8YFLogxK
U2 - 10.1142/S1793830921500853
DO - 10.1142/S1793830921500853
M3 - Article
AN - SCOPUS:85103947461
SN - 1793-8309
JO - Discrete Mathematics, Algorithms and Applications
JF - Discrete Mathematics, Algorithms and Applications
M1 - 2150085
ER -