Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

DOI10.1016/j.fss.2005.06.005zbMath1085.03044OpenAlexW2119876047MaRDI QIDQ812624

Manolis Wallace, Yannis Avrithis, Stefanos D. Kollias

Publication date: 24 January 2006

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2005.06.005

zbMATH Keywords

computational complexitysparse matricestransitive closurefuzzy relationsfuzzy partial orderingsup-t-transitivity

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets ⋮ Algorithms for computing the optimal transitive approximation of a proximity relation ⋮ Finding rough and fuzzy-rough set reducts with SAT ⋮ Formal concept analysis based on fuzzy granularity base for different granulations ⋮ Computing a T-transitive lower approximation or opening of a proximity relation

Uses Software

• WordNet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abstract derivation of transitive closure algorithms
• On compositions of lattice matrices
• On the all-pairs-shortest-path problem in unweighted undirected graphs.
• Calculating path algorithms
• The input/output complexity of transitive closure
• Structure of transitive valued binary relations
• Transitive approximation of fuzzy relations by alternating closures and openings
• Fuzzy information retrieval based on multi-relationship fuzzy concept networks.
• On the existence and construction of \(T\)-transitive closures.
• Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
• Numerical representation of transitive fuzzy relations
• The transitive closure, convergence of powers and adjoint of generalized fuzzy matrices
• A limit theorem in dynamic fuzzy systems with transitive fuzzy relations
• A representation theorem for min-transitive fuzzy relations
• Similarity relations and fuzzy orderings
• A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
• Some Recent Investigations of a New Fuzzy Partitioning Algorithm and its Application to Pattern Classification Problems
• A modification of Warshall's algorithm for the transitive closure of binary relations
• Fuzzy sets
• An algorithm for computing all paths in a graph
• A transitive closure algorithm
• A Theorem on Boolean Matrices
• Factoring fuzzy transitivity
• Transitive closure and betweenness relations
• Convergence of products of fuzzy matrices
• An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix

This page was built for publication: Computationally efficient sup-t transitive closure for sparse fuzzy binary relations