The complexity of ultrametric partitions on graphs (Q1098632)
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: The complexity of ultrametric partitions on graphs |
scientific article; zbMATH DE number 4039290
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of ultrametric partitions on graphs |
scientific article; zbMATH DE number 4039290 |
Statements
The complexity of ultrametric partitions on graphs (English)
0 references
1988
0 references
cluster analysis
0 references
automated design
0 references
VLSI circuits
0 references
ultrametric partitions
0 references
weighted complete graph
0 references
computational complexity
0 references
polynomial algorithm
0 references
