A PARALLEL COST-OPTIMAL ALGORITHM TO COMPUTE THE SUPREMUM OF MAX-MIN POWERS

作     者：SURAWEERA, F BHATTACHARYA, P 

作者机构：UNIV NEBRASKADEPT COMP SCI & ENGNLINCOLNNE 68588 

出 版 物：《PARALLEL COMPUTING》 (并行计算)

年 卷 期：1992年第18卷第5期

页      面：551-556页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：MAX-MIN PRODUCT PARALLEL ALGORITHM SPANNING TREE DEPTH 1ST SEARCH 

摘      要：A parallel cost-optimal algorithm to compute the supremum of max-min powers of any map (graph) is obtained using the EREW SM SIMD computer as the model of computation. The run-time of the algorithm is O(n) using n processors where n is the number of elements in the underlying set (the vertices of the graph).