A parallel cost-optimal algorithm to compute the supremum of max-min powers

DOI10.1016/0167-8191(92)90090-TzbMath0754.68059OpenAlexW2016205258MaRDI QIDQ1195163

Prabir Bhattacharya, Francis Suraweera

Publication date: 7 October 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90090-t

zbMATH Keywords

clusteringmax-min productspanning treedepth first searchunsupervised pattern recognitionEREW SM SIMD computer

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

This page was built for publication: A parallel cost-optimal algorithm to compute the supremum of max-min powers