Efficient computation of transitive closures

DOI10.1016/0165-0114(90)90101-BzbMath0717.94020OpenAlexW2108843088MaRDI QIDQ2639033

Henrik Legind Larsen, Ronald R. Yager

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0165-0114(90)90101-b

zbMATH Keywords

computational complexitytransitive closuremax-min compositionfuzzy proximity relationmax-min closurespace and time complexities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Related Items

Fuzzy functional dependencies and Bayesian networks, A fuzzy approach to classification of text documents, Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation., The fuzzy association degree in semantic data models, UPGMA clustering revisited: a weight-driven approach to transitive approximation, The fuzzy functional dependency on the basis of the semantic distance, Iterates of fuzzy circulant matrices

Cites Work

• Unnamed Item
• Unnamed Item