An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix (Q5951773)

There are diverse algorithms for the determination of the transitive closure of fuzzy relations [cf. \textit{J. C. Dunn}, J. Cybernetics 4 (1974), No. 2, 1-15 (1975; Zbl 0304.68094); \textit{H. B. Potoczny}, Fuzzy Sets Syst. 12, 231-235 (1984; Zbl 0547.68097); \textit{X. Xiao}, Fuzzy Math. 5(4), 71-73 (1985)]. The problem is simpler in the case of reflexive and symmetric fuzzy relations [similarity relations, cf. \textit{G. Fu}, Fuzzy Sets Syst. 51, No. 2, 189-194 (1992; Zbl 0787.62062)]. This paper brings the optimal algorithm for constructing the transitive closure of a reflexive and symmetric fuzzy relation on a finite set \(X\) (if \(\operatorname {card} X = n\), then computational complexity of the algorithm is \(O(n^{2})\)).