Construction of skolem sequences

DOI10.1080/00207169808804756MaRDI QIDQ4236116zbMATH OpenOpenAlexFDO

Authors A. Sharaf Eldin, Nabil Shalaby, Fawzi 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)

Cites work

• A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares
• A perfect one-factorization for \(K_{36}\)
• Generation of binary sequences with controllable complexity
• Hill Climbing with Multiple Local Optima
• scientific article; zbMATH DE number 45817 (Why is no real title available?)
• On sets of three mols with holes
• Some Remarks on the Triple Systems of Steiner.
• The use of hill‐climbing to construct orthogonal steiner triple systems

Cited in

(4)

• Hooked k-extended Skolem sequences
• The intersection spectrum of Skolem sequences and its applications to -fold cyclic triple systems
• scientific article; zbMATH DE number 682566 (Why is no real title available?)
• Extended skolem sequences

This page was built for publication: Construction of skolem sequences

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