Title of article
Linear matrix period in max-plus algebra Original Research Article
Author/Authors
Martin Gavalec، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
16
From page
167
To page
182
Abstract
Linear periodicity of matrices in max-plus algebra is studied. It is proved that the linear period of a matrix can be computed in O(n3) time if the digraph of the matrix is strongly connected. The general problem of deciding whether a given matrix is almost linear periodic is shown to be NP-complete.
Keywords
NP-completeness , Max-plus algebra , Linear matrix period
Journal title
Linear Algebra and its Applications
Serial Year
2000
Journal title
Linear Algebra and its Applications
Record number
822939
Link To Document