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

European Journal of Operational Research

Volumn 155, Issue 1, 2004, Pages 226-238

  De Meyer, H ^a   Naessens, H ^b   De Baets, B ^a  

^a GHENT UNIVERSITY   (Belgium)

^b UNIVERSITY COLLEGE GHENT   (Belgium)

Author keywords

Fuzzy relation; Fuzzy sets; Maximum weight spanning tree; Transitive closure

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; TREES (MATHEMATICS);

PROXIMITY RELATIONS; TRANSITIVE CLOSURE;

FUZZY SETS;

EID: 0347540951     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00730-0     Document Type: Article

References (13)

1. Bandler W., Kohout L. Special properties, closures and interiors of crisp and fuzzy relations. Fuzzy. Set. Syst. 26:1988;317-331.
2. B. DeBaets, H. De Meyer, On the existence and construction of T -transitive closures, Inform. Sci., in press.
3. Dunn J. A graph-theoretical analysis of pattern classification via Tamura's fuzzy relation. IEEE Trans. SMC. 5:1974;310-313.
4. Feijs L., van Ommering R. Abstract derivation of transitive closure algorithms. Inform. Proc. Lett. 63:1997;159-164.
5. Guoyao F. An algorithm for computing the transitive closure of a fuzzy similarity matrix. Fuzzy. Set. Syst. 51:1992;189-194.
6. Kandel A., Yelowitz L. Fuzzy chains. IEEE Trans. SMC. 5:1974;472-475.
7. 2) algorithm for computing the min-transitive closure of a weighted graph Inform. Proc. Lett. 74:2000;215-220.
8. Larsen H., Yager R. Efficient computation of transitive closures. Fuzzy. Set. Syst. 38:1990;81-90.
9. Li S.-Y. The simplest method of ascending value to find fuzzy transitive closure. Fuzzy. Set. Syst. 38:1990;91-96.
10. Miller R., Boxer L. Algorithms Sequential and Parallel, a Unified Approach. 2000;Prentice Hall, Upper Saddle River, NJ.
11. Naessens H., De Meyer H., De Baets B. Algorithms for the computation of. T -transitive closures IEEE Trans. Fuzzy Syst. 10:2002;541-551.
12. J. Ullman, M. Yannakis, The input/output complexity of transitive closure, in: Proceedings of the ACM-SIGMOD 1990 International Conference on Management of Data, pp. 44-53, 1990.
13. Zadeh L. Similarity relations and fuzzy orderings. Inform. Sci. 3:1971;177-200.