The general trapezoidal algorithm for strongly regular max–min matrices

The problem of the strong regularity for square matrices over a general max–min algebra is considered. An O(n2logn) 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.