⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

July 1, 1987SIAM Journal on Algebraic and Discrete Methods

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

Jeffrey H. Dinitz Douglas R. Stinson

View at Publisher

Ask AI

Bookmark

Share

Abstract

In this paper we describe and discuss hill-climbing algorithms for the construction of one- factorizations of complete graphs, and orthogonal one-factorizations of complete graphs (i.e., Room squares).

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Dinitz et al. (1987) studied this question.

synapsesocial.com/papers/6ab5cb6fe98445160f249f18 https://doi.org/10.1137/0608035

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1One‐factorizations of the complete graph—A surveyOriginal Research · 1985 · 179 citations
2Latent Subsets for Dual Intersecting SystemsSIAM Journal on Algebraic and Discrete Methods · Thu,
3On One-Sided Jacobi Methods for Parallel ComputationSIAM Journal on Algebraic and Discrete Methods · Thu,
4The Null Space Problem II. AlgorithmsSIAM Journal on Algebraic and Discrete Methods · Thu,
5A Dynamic Programming Approach to the Dominating Set Problem on k -TreesSIAM Journal on Algebraic and Discrete Methods · Thu,

More from SIAM Journal on Algebraic and Discrete Methods

An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector ProcessorWed,
Network ResilienceWed,
Computing a Sparse Basis for the Null SpaceWed,
Inherited Matrix Entries: Principal Submatrices of the InverseWed,
Group Convolutions and Matrix TransformsWed,