Finding tight single-change covering designs with \(v=20, k=5\)

DOI10.1016/S0012-365X(00)00334-4zbMath0973.05018OpenAlexW2042322788MaRDI QIDQ5937605

N. C. K. Phillips

Publication date: 28 November 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00334-4

zbMATH Keywords

backtrack searchtight single-change covering designs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Linear and circular single‐change covering designs revisited ⋮ Research problems from the 19th British Combinatorial Conference

This page was built for publication: Finding tight single-change covering designs with \(v=20, k=5\)