A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares
From MaRDI portal
Publication:3029017
DOI10.1137/0608035zbMath0626.05007OpenAlexW1982740217MaRDI QIDQ3029017
Jeffrey H. Dinitz, Douglas R. Stinson
Publication date: 1987
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/81fd9e31a4f360d4b2df5fbbfaa7c90a88d9fbe1
Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Efficient, local and symmetric Markov chains that generate one-factorizations ⋮ Switching codes and designs ⋮ Higher melonic theories ⋮ Construction of skolem sequences ⋮ Howell designs with sub-designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The spectrum of room cubes
- The existence of Room squares
- 2000000 Steiner Triple Systems of Order 19
- One-factorizations of the complete graph—A survey
- A Fast Algorithm for Finding Strong Starters
- Kotzig Factorizations: Existence and Computational Results
This page was built for publication: A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares
