Skip to main content
Conference Proceedings

Computing a transitive opening of a reflexive and symmetric fuzzy relation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3571 LNAI 587-599
DOI: 10.1007/11518655_50
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There are fast algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute transitive openings from a given fuzzy relation. In this paper a method to compute a transitive opening of a reflexive and symmetric fuzzy relation is given, Even though there is not a unique transitive opening of a fuzzy relation, it is proved that the computed transitive opening closure is maximal. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Garmendia, L., & Salvador, A. (2005). Computing a transitive opening of a reflexive and symmetric fuzzy relation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3571 LNAI, pp. 587–599). Springer Verlag. https://doi.org/10.1007/11518655_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free