AN ADAPTIVE AND COST-OPTIMAL PARALLEL ALGORITHM FOR MINIMUM SPANNING-TREES

被引：8

作者：

AKL, SG

机构：

来源：

关键词：

D O I：

10.1007/BF02240073

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：271 / 277

页数：7

共 30 条

[1] AN OPTIMAL ALGORITHM FOR PARALLEL SELECTION [J].

AKL, SG .

AKL, SG .

[3]

ATALLAH MJ, 1984, J ACM, V31, P649, DOI 10.1145/828.322449

[4]

ATALLAH MJ, 1983, THESIS J HOPKINS U B

[5]

AWERBUCK B, 1983, 1983 P INT C PAR PRO, P175

[6]

Bentley J. L., 1980, J ALGORITHMS, V1, P51

[7] EFFICIENT PARALLEL ALGORITHMS FOR SOME GRAPH PROBLEMS [J].

CHIN, FY ;

LAM, J ;

CHEN, IN .

[8]

DEO N, 1981, 1981 P INT C PAR PRO, P188

[9] VERY HIGH-SPEED COMPUTING SYSTEMS [J].

FLYNN, MJ .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (12) :1901-&

[10] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].

GALLAGER, RG ;

HUMBLET, PA ;

SPIRA, PM .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77