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 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:50, 31 January 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
