Augmentation of covering arrays of strength two

DOI10.1007/S00373-014-1519-9zbMATH Open1327.05040OpenAlexW1965687751MaRDI QIDQ897271FDOQ897271

Authors: Charles J. Colbourn 

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1519-9

Recommendations

• Covering arrays, augmentation, and quilting arrays
• Tower of covering arrays
• Strength two covering arrays: existence tables and projection
• Covering arrays of strength three
• Randomized postoptimization of covering arrays

zbMATH Keywords

augmentationKruskal-Katona theoremcovering array

Mathematics Subject Classification ID

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

Cites Work

• Strength two covering arrays: existence tables and projection
• Problems and algorithms for covering arrays
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge disjoint placement of graphs
• A simple proof of the Kruskal-Katona theorem
• A new short proof for the Kruskal-Katona theorem
• On the state of strength-three covering arrays
• Title not available (Why is that?)
• Software and hardware testing using combinatorial covering suites
• Covering and radius-covering arrays: constructions and classification
• Randomized post-optimization of covering arrays

This page was built for publication: Augmentation of covering arrays of strength two

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