Regularity of matrices in min-algebra and its time-complexity
From MaRDI portal
Publication:1346691
DOI10.1016/0166-218X(94)00099-YzbMath0820.15003MaRDI QIDQ1346691
Publication date: 10 April 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
algorithm; normal matrix; discrete event dynamic systems; even cycle; time-complexity; linearly ordered commutative group; min-algebra; checking regularity of matrices
15A30: Algebraic systems of matrices
65Y20: Complexity and performance of numerical algorithms
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Methods and applications of (max,+) linear algebra, A note on the parity assignment problem, Max-algebra: The linear algebra of combinatorics?, Carathéodory, Helly and the others in the max-plus world
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item