An Efficient Algorithm for Latin Squares in a Bipartite Min-Max-Plus System

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...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-08
Main Authors: Mubasher Umer, Umar Hayat, Fazal Abbas, Agarwal, Anurag, Kitanov, Petko
Format: Article
Language:English
Subjects:
Algorithms
Arrays
Eigenvalues
Eigenvectors
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422