Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (Q1428064)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. |
scientific article; zbMATH DE number 2056223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. |
scientific article; zbMATH DE number 2056223 |
Statements
Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (English)
0 references
14 March 2004
0 references
Fuzzy sets
0 references
Fuzzy relation
0 references
Transitive closure
0 references
Maximum weight spanning tree
0 references
0 references
0.87412465
0 references
0.8734162
0 references
0.8552941
0 references
0.8504914
0 references
0.8501665
0 references
0.8448727
0 references
0.8443226
0 references
0.8437498
0 references
