Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares

@inproceedings{Vatutin2017UsingGS,
title={Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares},
author={Eduard Vatutin and O. S. Zaikin and Alina Zhuravlev and Maxim Manzyuk and Stepan Kochemazov and Vladimir S. Titov},
year={2017}
}

In this paper we consider the problem of enumerating diagonal Latin squares of small order. In particular we discuss possible algorithmic approaches to this problem and show our results in this regard. Surprisingly, our research showed that the best algorithm for enumerating diagonal Latin squares consists of a number of fixed loops, and its effectiveness can be significantly increased by careful tuning and applying special heuristics. We used the constructed algorithm to enumerate all diagonal… CONTINUE READING

Applying high-performance computing to searching for triples of partially orthogonal Latin squares of order

M. O. Manzyuk

Proceedings of the 10th Annual International…

2016

Employing algorithmic features of the problem for generation of diagonal Latin squares // Proceedings of the South-West State University. Series ‘Control, Computer Engineering, Information Science

E. I. Vatutin, A. D. Zhuravlev, O. S. Zaikin, V. S. Titov

Medical Instruments

2016

Features of the use of weighting heuristics in the search for diagonal Latin squares / / Proceedings of the South - West State University

I. VatutinE., D. ZhuravlevA., S. ZaikinO., S. TitovV.

2015

The search for pairs of orthogonal diagonal Latin Squares of order 10 in the volunteer computing project

S. ZaikinO., E. KochemazovS.

2015

Handbook of Combinatorial Designs // Second Edition. Chapman&Hall