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

From MaRDI portal
Created claim: Wikidata QID (P12): Q60258317, #quickstatements; #temporary_batch_1705103307034
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: H. E. De Meyer / rank
Normal rank
 
Property / author
 
Property / author: Helga Naessens / rank
Normal rank
 
Property / author
 
Property / author: H. E. De Meyer / rank
 
Normal rank
Property / author
 
Property / author: Helga Naessens / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special properties, closures and interiors of crisp and fuzzy relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract derivation of transitive closure algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing the transitive closure of a fuzzy similarity matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of transitive closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplest method of ascending value to find fuzzy transitive closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity relations and fuzzy orderings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 15:40, 6 June 2024

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