Regularity of matrices in min-algebra and its time-complexity

DOI10.1016/0166-218X(94)00099-YzbMath0820.15003MaRDI QIDQ1346691

Peter Butkovic

Publication date: 10 April 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmnormal matrixdiscrete event dynamic systemseven cycletime-complexitylinearly ordered commutative groupmin-algebrachecking regularity of matrices

Mathematics Subject Classification ID

Algebraic systems of matrices (15A30) Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Max-algebra: The linear algebra of combinatorics?, Methods and applications of (max,+) linear algebra, Carathéodory, Helly and the others in the max-plus world, A note on the parity assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A condition for the strong regularity of matrices in the minimax algebra
• Even cycles in directed graphs
• Strong regularity of matrices -- a survey of results
• Discrete-event dynamic systems: The strictly convex case
• The Even Cycle Problem for Directed Graphs