A Fast Algorithm for Finding Strong Starters
From MaRDI portal
Cites work
- An Existence Theorem for Room Squares*
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- Construction of Room Squares
- Hamiltonian circuits in random graphs
- 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?)
- Probabilistic Analysis of Network Flow Algorithms
- Room designs and one-factorizations
- The existence of Room squares
Cited in
(11)- The existence of Room 5-cubes
- A perfect one-factorization for \(K_{36}\)
- The spectrum of room cubes
- Orthogonal starters in finite abelian groups
- A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares
- Strong Skolem starters
- On products of strong Skolem starters
- Orthogonal and strong frame starters: revisited
- Constructing strong starters of orders 3p: triplication with SAT solver
- The triplication method for constructing strong 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)
