Backtracking algorithm for finding t‐designs

DOI10.1002/jcd.10045zbMath1019.05011OpenAlexW2021476084MaRDI QIDQ4416295

M. M-Noori, B. Tayfeh-Rezaie

Publication date: 31 July 2003

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10045

zbMATH Keywords

automorphism groupisomorph rejection

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Large sets of \(t\)-designs through partitionable sets: a survey ⋮ Classification of simple 2-(11,3,3) designs

This page was built for publication: Backtracking algorithm for finding t‐designs