A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares

DOI10.1137/0608035MaRDI QIDQ3029017zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

one-factorizationsRoom squareshill-climbing algorithms

Mathematics Subject Classification ID

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)

Cites work

• scientific article; zbMATH DE number 3827889 (Why is no real title available?)
• scientific article; zbMATH DE number 3948279 (Why is no real title available?)
• scientific article; zbMATH DE number 3948281 (Why is no real title available?)
• scientific article; zbMATH DE number 3961622 (Why is no real title available?)
• scientific article; zbMATH DE number 3724473 (Why is no real title available?)
• 2000000 Steiner Triple Systems of Order 19
• A Fast Algorithm for Finding Strong Starters
• Kotzig Factorizations: Existence and Computational Results
• One-factorizations of the complete graph—A survey
• Quantum private communication
• The existence of Room squares
• The spectrum of room cubes

Cited in

(7)

• Construction of skolem sequences
• Howell designs with sub-designs
• Switching codes and designs
• Efficient, local and symmetric Markov chains that generate one-factorizations
• Orthogonal and strong frame starters: revisited
• Orthogonal one-factorization graphs
• Higher melonic theories

This page was built for publication: A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares

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