A parallel cost-optimal algorithm to compute the supremum of max-min powers (Q1195163)
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: A parallel cost-optimal algorithm to compute the supremum of max-min powers |
scientific article; zbMATH DE number 69183
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel cost-optimal algorithm to compute the supremum of max-min powers |
scientific article; zbMATH DE number 69183 |
Statements
A parallel cost-optimal algorithm to compute the supremum of max-min powers (English)
0 references
7 October 1992
0 references
max-min product
0 references
spanning tree
0 references
depth first search
0 references
clustering
0 references
unsupervised pattern recognition
0 references
EREW SM SIMD computer
0 references
0 references
0.87977946
0 references
0.8732882
0 references
0.8731204
0 references
0.86867434
0 references
