Mixed covering arrays on graphs

DOI10.1002/JCD.20149MaRDI QIDQ5434623zbMATH OpenOpenAlexFDO

Authors K. Meagher, Lucia Moura, Latifa Zekaoui

Publication date 7 January 2008

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

Full work available at URL https://doi.org/10.1002/jcd.20149

zbMATH Keywords

software testingcovering arraymixed covering arraysqualitative independence graphs

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Recommendations

• scientific article; zbMATH DE number 5556019
• Covering arrays with mixed alphabet sizes
• Mixed covering arrays on 3-uniform hypergraphs
• Constructions of mixed covering arrays with strength \( \ge 3\)
• Mixed covering arrays of strength three with few factors

Cited in

(18)

• Optimal and near-optimal mixed covering arrays by column expansion
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Divisibility of polynomials over finite fields and combinatorial applications
• Covering array on the Cartesian product of hypergraphs
• Constructions of mixed covering arrays with strength \( \ge 3\)
• Covering arrays on graphs
• Mixed covering arrays on graphs of small treewidth
• Binary covering arrays on tournaments
• The test suite generation problem: optimal instances and their implications
• Mixed covering arrays on 3-uniform hypergraphs
• Covering Arrays Avoiding Forbidden Edges
• A hyperedge coloring and application in combinatorial testing
• Cost-efficient mixed-level covering designs for testing experiments
• Disjoint Covers in Replicated Heterogeneous Arrays
• scientific article; zbMATH DE number 5556019 (Why is no real title available?)
• Covering arrays avoiding forbidden edges
• Mixed covering arrays of strength three with few factors
• Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)

This page was built for publication: Mixed covering arrays on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434623)