Construction of skolem sequences

DOI10.1080/00207169808804756zbMath0918.68070OpenAlexW2025715261MaRDI QIDQ4236116

Nabil Shalaby, A. Sharaf Eldin, Fawzi A. Al-Thukair

Publication date: 23 August 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804756

zbMATH Keywords

hill-climbing algorithmSkolem sequences

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (1)

The intersection spectrum of Skolem sequences and its applications to \(\lambda\)-fold cyclic triple systems

Cites Work

• Unnamed Item
• On sets of three mols with holes
• A perfect one-factorization for \(K_{36}\)
• A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares
• Some Remarks on the Triple Systems of Steiner.
• Hill Climbing with Multiple Local Optima
• The use of hill‐climbing to construct orthogonal steiner triple systems
• Generation of binary sequences with controllable complexity

This page was built for publication: Construction of skolem sequences