Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (Q1428064): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: H. E. De Meyer / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Helga Naessens / rank | |||
Normal rank | |||
Revision as of 02:45, 21 February 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
14 March 2004
0 references
Fuzzy sets
0 references
Fuzzy relation
0 references
Transitive closure
0 references
Maximum weight spanning tree
0 references
