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

From MaRDI portal
Revision as of 01:57, 13 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60258317, #quickstatements; #temporary_batch_1705103307034)
scientific article
Language Label Description Also known as
English
Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
scientific article

    Statements

    Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    Fuzzy sets
    0 references
    Fuzzy relation
    0 references
    Transitive closure
    0 references
    Maximum weight spanning tree
    0 references
    0 references