Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.

DOI10.1016/S0377-2217(02)00730-0zbMath1043.90087OpenAlexW2030968866WikidataQ60258317 ScholiaQ60258317MaRDI QIDQ1428064

Bernard De Baets, H. E. De Meyer, Helga Naessens

Publication date: 14 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00730-0

zbMATH Keywords

Fuzzy setsTransitive closureFuzzy relationMaximum weight spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (15)

Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets ⋮ On the compositional characterization of complete fuzzy pre-orders ⋮ Fuzzy relations for the analysis of traders' preferences in an information market game ⋮ On the \(T_L\)-transitivity of fuzzy similarity measures ⋮ Algorithms for computing the optimal transitive approximation of a proximity relation ⋮ The stability of local properties of fuzzy relations under ordinal equivalence ⋮ On the transitivity of a parametric family of cardinality-based similarity measures ⋮ Formal concept analysis based on fuzzy granularity base for different granulations ⋮ Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge ⋮ Equivalent bipolar fuzzy relations ⋮ UPGMA clustering revisited: a weight-driven approach to transitive approximation ⋮ Lattice-valued \(F\)-transforms and similarity relations ⋮ The role a fuzzy implication plays in a multi-criteria decision algorithm ⋮ Closing reciprocal relations w.r.t. stochastic transitivity ⋮ Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

Cites Work

• Abstract derivation of transitive closure algorithms
• An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
• Special properties, closures and interiors of crisp and fuzzy relations
• An algorithm for computing the transitive closure of a fuzzy similarity matrix
• Similarity relations and fuzzy orderings
• Efficient computation of transitive closures
• The simplest method of ascending value to find fuzzy transitive closure
• A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
• Fuzzy Chains

This page was built for publication: Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.