A Fast Algorithm for Finding Strong Starters

DOI10.1137/0602007MaRDI QIDQ3964583zbMATH OpenOpenAlexFDO

Authors J. H. Dinitz, D. 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

Howell designRoom squarestrong starter

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3724473 (Why is no real title available?)
• scientific article; zbMATH DE number 3475458 (Why is no real title available?)
• scientific article; zbMATH DE number 3508514 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 3621746 (Why is no real title available?)
• scientific article; zbMATH DE number 3372057 (Why is no real title available?)
• An Existence Theorem for Room Squares*
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Construction of Room Squares
• Hamiltonian circuits in random graphs
• Probabilistic Analysis of Network Flow Algorithms
• Room designs and one-factorizations
• The existence of Room squares

Cited in

(9)

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

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

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