Abstract
This work discusses the eigenproblems of bipartite (min, max, +)-systems when the system matrices are Latin squares. We propose an approach to characterize and compute the eigenvalue, trivial eigenvectors and nontrivial eigenvectors. The time complexity of the overall approach is a polynomial w.r.t. the dimension of the system.
Original language | English |
---|---|
Pages (from-to) | 657-668 |
Number of pages | 12 |
Journal | Discrete Event Dynamic Systems: Theory and Applications |
Volume | 26 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Dec 2016 |
Keywords
- Bipartite (min, max, +)-systems
- Eigenvalue
- Eigenvectors
- Latin square
- Permutation