  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.
