Covering arrays, augmentation, and quilting arrays

DOI10.1142/S1793830914500347zbMath1298.05046MaRDI QIDQ2920882

Charles J. Colbourn

Publication date: 29 September 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

augmentationorthogonal arraycovering arrayquilting array

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Constructions of covering arrays of strength five
• Covering and radius-covering arrays: constructions and classification
• Constructing strength three covering arrays with augmented annealing
• Tabu search for covering arrays using permutation vectors
• Covering arrays from cyclotomy
• Randomized post-optimization of covering arrays
• A survey of combinatorial testing
• On the state of strength-three covering arrays
• Iterative Exhaustive Pattern Generation for Logic Testing
• Binary Covering Arrays and Existentially Closed Graphs
• Covering arrays of higher strength from permutation vectors
• Mutually orthogonal Latin squares: A brief survey of constructions

This page was built for publication: Covering arrays, augmentation, and quilting arrays