A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The International Workshop on Information, Computation, and Control Systems for Distributed Environments
The paper discusses the reduction of problems based on Latin squares to the exact cover problem aiming at its subsequent solution using the dancing links algorithm. The former problems include generation of Latin squares and diagonal Latin squares of a general form/with a given normalization, generation of orthogonal Latin and diagonal Latin squares directly/through the set of transversals, obtaining a set of transversals for a given square, forming a subset of disjoint transversals. For eachdoi:10.47350/iccs-de.2020.26 fatcat:76hisn2fxrh7noqcyjrb24lh2a