A Fast Algorithm for Finding Strong Starters

DOI10.1137/0602007zbMath0499.05016OpenAlexW1980876243MaRDI QIDQ3964583

Jeffrey H. Dinitz, Douglas R. Stinson

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602007

zbMATH Keywords

Room squareHowell designstrong starter

Mathematics Subject Classification ID

Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Algorithms in computer science (68W99) Abelian groups (20K99)

Related Items (7)

The existence of Room 5-cubes ⋮ A perfect one-factorization for \(K_{36}\) ⋮ The spectrum of room cubes ⋮ Strong Skolem starters ⋮ A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares ⋮ Orthogonal starters in finite abelian groups ⋮ The spectrum of Room cubes

Cites Work

• Room designs and one-factorizations
• The existence of Room squares
• Hamiltonian circuits in random graphs
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Probabilistic Analysis of Network Flow Algorithms
• Construction of Room Squares
• An Existence Theorem for Room Squares*
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Fast Algorithm for Finding Strong Starters