An Efficient Algorithm for Latin Squares in a Bipartite Min-Max-Plus System
Rings and Algebras
2019-08-23 v1 Combinatorics
Abstract
In this paper, we consider the eigenproblems for Latin squares in a bipartite min-max-plus system. The focus is upon developing a new algorithm to compute the eigenvalue and eigenvectors (trivial and non-trivial) for Latin squares in a bipartite min-max-plus system. We illustrate the algorithm using some examples. Furthermore, we compare the results of our algorithm with some of the existing algorithms which shows that the propose method is more efficient.
Cite
@article{arxiv.1908.08371,
title = {An Efficient Algorithm for Latin Squares in a Bipartite Min-Max-Plus System},
author = {Mubasher Umer and Umar Hayat and Fazal Abbas and Anurag Agarwal and Petko Kitanov},
journal= {arXiv preprint arXiv:1908.08371},
year = {2019}
}