The general trapezoidal algorithm for strongly regular max–min matrices

✍ Scribed by Martin Gavalec

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 172 KB
• Volume: 369
• Category: Article
• ISSN: 0024-3795
• DOI: 10.1016/s0024-3795(03)00369-0

✦ Synopsis

The problem of the strong regularity for square matrices over a general max-min algebra is considered. An O(n 2 log n) algorithm for recognition of the strong regularity of a given n × n matrix is proposed. The algorithm works without any restrictions on the underlying max-min algebra, concerning the density, or the boundedness.