A Fast Algorithm for Finding Strong Starters

DOI10.1137/0602007zbMATH Open0499.05016OpenAlexW1980876243MaRDI QIDQ3964583FDOQ3964583

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

• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Hamiltonian circuits in random graphs
• The existence of Room squares
• An Existence Theorem for Room Squares*
• Title not available (Why is that?)
• Construction of Room Squares
• Room designs and one-factorizations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic Analysis of Network Flow Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

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

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)