For Latin squares in bipartite min-max-plus systems, the paper gives an eigenvalue-first power algorithm and calls it efficient, but the proof that the first-cycle vector is an eigenvector is invalid and no benchmark is provided.
On the ultimate behavior of the sequence of cons ecutive powers of a matrix in the max-plus algebra
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Efficient Algorithm for Latin Squares in a Bipartite Min-Max-Plus System
For Latin squares in bipartite min-max-plus systems, the paper gives an eigenvalue-first power algorithm and calls it efficient, but the proof that the first-cycle vector is an eigenvector is invalid and no benchmark is provided.