论文信息 - Linear matrix period in max-plus algebra

Linear matrix period in max-plus algebra

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 (n 3 ) 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.

Martin Gavalec

[1] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[2] Li Jian-Xin. Periodicity of powers of fuzzy matrices (finite fuzzy relations) , 1992 .

[3] J. Quadrat,et al. A linear-system-theoretic view of discrete-event processes , 1983, The 22nd IEEE Conference on Decision and Control.

[4] Karl Nachtigall,et al. Powers of matrices over an extremal algebra with applications to periodic graphs , 1997, Math. Methods Oper. Res..

[5] M. Thomason. Convergence of powers of a fuzzy matrix , 1977 .

[6] Li Jian-Xin,et al. An upper bound on indices of finite fuzzy relations , 1992 .

[7] Katarína Cechlárová,et al. On the powers of matrices in bottleneck/fuzzy algebra , 1996 .

[8] Richard M. Karp,et al. A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[9] Martin Gavalec,et al. Computing orbit period in max-min algebra , 2000, Discret. Appl. Math..

[10] U. Zimmermann. Linear and combinatorial optimization in ordered algebraic structures , 1981 .

[11] Arthur F. Veinott,et al. Computing a graph's period quadratically by node condensation , 1973, Discret. Math..

[12] Martin Gavalec,et al. Computing Matrix Period in Max-min Algebra , 1997, Discret. Appl. Math..