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

DOI10.1137/0608035zbMATH Open0626.05007OpenAlexW1982740217MaRDI QIDQ3029017FDOQ3029017

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

• The existence of Room squares
• One-factorizations of the complete graph—A survey
• 2000000 Steiner Triple Systems of Order 19
• Title not available (Why is that?)
• Kotzig Factorizations: Existence and Computational Results
• Quantum private communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fast Algorithm for Finding Strong Starters
• Title not available (Why is that?)
• The spectrum of room cubes

Cited In (7)

• Construction of skolem sequences
• Howell designs with sub-designs
• Efficient, local and symmetric Markov chains that generate one-factorizations
• Switching codes and designs
• 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)