Mixed covering arrays on graphs
From MaRDI portal
Publication:5434623
DOI10.1002/jcd.20149zbMath1137.05016OpenAlexW1966120745MaRDI QIDQ5434623
Karen Meagher, Latifa Zekaoui, Lucia Moura
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
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items (10)
The test suite generation problem: optimal instances and their implications ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Covering arrays on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ A hyperedge coloring and application in combinatorial testing ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Divisibility of polynomials over finite fields and combinatorial applications ⋮ Mixed covering arrays of strength three with few factors ⋮ Cost-efficient mixed-level covering designs for testing experiments ⋮ Covering arrays avoiding forbidden edges
This page was built for publication: Mixed covering arrays on graphs