References
- Akian, M., R. Bapat, and S. Gaubert. 2006. “Max-plus Algebra.” Chap. 25 in Handbook of Linear Algebra. Discrete Mathematics and its Applications, edited by L. Hogben, 25-1–25-17. Dordrecht: Chapman & Hall/CRC.
- Bapat, R. 1998. “A Max Version of the Perron--Frobenius Theorem.” Linear Algebra and its Applications 275–276: 3–18.
- Belohlavek, R. 2012. “Optimal Decompositions of Matrices with Entries from Residuated Lattices.” Journal of Logic and Computation 22 (6): 1405–1425.
- Belohlavek, R., and V. Vychodil. 2010. “Discovery of Optimal Factors in Binary Data via a Novel Method of Matrix Decomposition.” Journal of Computer and System Sciences 76 (1): 3–20.
- Brualdi, R. A., and H. J. Ryser. 1991. Combinatorial Matrix Theory. Vol. 39 of Encyclopedia of Mathematics and its Applications. Cambridge: Cambridge University Press.
- Butkovič, P., R. Cunninghame-Green, and S. Gaubert. 2009. “Reducible Spectral Theory with Applications to the Robustness of Matrices in Max Algebra.” SIAM Journal of Matrix Analysis and Applications 31 (3): 1412–1431.
- Davey, B., and H. Priestley. 2002. Introduction to Lattices and Order. 2nd ed. Cambridge: Cambridge University Press.
- Ganter, B., and R. Wille. 1999. Formal Concept Analysis: Mathematical Foundations. Berlin: Springer.
- Goguen, J. A. 1967. “L-fuzzy Sets.” Journal of Mathematical Analysis and Applications 18 (1): 145–174.
- Golan, J. S. 1999. Semirings and their Applications. Dordrecht: Kluwer Academic.
- Gondran, M., and M. Minoux. 1977. “Valeurs propres et vecteurs propres dans les dioïdes et leur interprétation en théorie des graphes [Eigenvectors and Eigenvalues in Dioids and their Interpretation in Graph Theory].” EDF, Bulletin de la Direction des Etudes et Recherches, Serie C, Mathématiques Informatique 2: 25–41.
- Gondran, M., and M. Minoux. 2007. “Dioids and Semirings: Links to Fuzzy Set and Other Applications.” Fuzzy Sets and Systems 158: 1273–1294.
- Jun, M., G. Yan, and D. Zhi Yong. 2005. “The Eigen-problem in the Completely Max-algebra.” In Proceedings of the Sixth International Conference on Parallel and Distributed Computing PDCAT 2005, 1013–1016. Dalian, December 5--8.
- Mehlhorn, K., and P. Sanders. 2008. Algorithms and Data Structures. The Basic Toolbox. Chap. 9. Berlin: Springer.
- Schmidt, G., and T. Ströhlein. 1993. Relations and Graphs. Discrete Mathematics for Computer Scientists. Berlin: Springer.
- Tarjan, R. 1972. “Depth-first Search and Linear Graph Algorithms.” SIAM Journal on Computing 1: 146–160.
- Valverde-Albacete, F. J., and C. Peláez-Moreno. 2008. “Spectral Lattices of (Rmax,+-Formal Contexts.” In Formal Concept Analysis. Proceedings of the 6th International Conference, ICFCA 2008, Montreal, Canada, February 25--28. Lecture Notes in Computer Science (LCNS 4933): 124–139.
- Valverde-Albacete, F. J., and C. Peláez-Moreno. 2011. “Extending Conceptualisation Modes for Generalised Formal Concept Analysis.” Information Sciences 181: 1888–1909.
- Valverde-Albacete, F. J., and C. Peláez-Moreno. 2015. “Spectral Lattices of Irreducible Matrices over Completed Idempotent Semifields.” Fuzzy Sets and Systems 271: 46–69. doi:10.1016/j.fss.2014.09.022.