Mixed covering arrays on graphs
From MaRDI portal
Publication:5434623
DOI10.1002/JCD.20149zbMATH Open1137.05016OpenAlexW1966120745MaRDI QIDQ5434623FDOQ5434623
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
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
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
- Covering Arrays Avoiding Forbidden Edges
- The test suite generation problem: optimal instances and their implications
- Mixed covering arrays on 3-uniform hypergraphs
- A hyperedge coloring and application in combinatorial testing
- Disjoint Covers in Replicated Heterogeneous Arrays
- Cost-efficient mixed-level covering designs for testing experiments
- Title not available (Why is that?)
- 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)
