Affiliation:
1. Hunan University of Science and Technology
2. Nanning College of Vocational and Technical
Abstract
To judge the loop-nonnegativity of a matrix over an idempotent semiring and compute the plus-closure of when it is loop-nonnegative, a Plus_Closure_of_Matrix algorithm of complexity is constructed and proved. As a generalization of Floyd algorithm, Warshall algorithm as well as Gauβ-Jordan Elimination algorithm on idempotent semirings, this algorithm can also be used to solve some Algebraic Path Problems, Shortest Path Problems and the transitive closures of matrices over idempotent semirings even if the idempotent semirings have no completeness and closeness.
Publisher
Trans Tech Publications, Ltd.
Reference16 articles.
1. Floyd R W. Algorithm 97: Shortest path[J]. Communications of the ACM, 1962, 5(6): 345.
2. Warshall S. A Theorem on Boolean Matrices[J]. Journal of the ACM, 1962, 9(1): 11-12.
3. Dasgupta S. Papadimitriou C. Vazirani U. Algorithms[M], The McGraw-Hill Companies, Inc., New York, (2008).
4. Carré B A. An algebra for network routine problems[J]. Journal of the Institute of Mathematical and Its Applications, 1971, 7: 273-294.
5. Zimmermann U. Linear and combinatorial optimization in ordered algebraic structures[J]. Annals of Discrete Mathematics, 1981, 10: 1-380.