AN OPTIMAL PARALLEL CONNECTIVITY ALGORITHM

被引：24

作者：

VISHKIN, U

机构：

[1] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

[2] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

DISCRETE APPLIED MATHEMATICS | 1984年 / 9卷 / 02期

关键词：

D O I：

10.1016/0166-218X(84)90019-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：197 / 207

页数：11

共 17 条

[1]

BORODIN A, 1982, 14TH P ACM S THEOR C, P338

[2] PARALLEL EVALUATION OF GENERAL ARITHMETIC EXPRESSIONS [J].

BRENT, RP .

JOURNAL OF THE ACM, 1974, 21 (02) :201-206

[3]

CHIN FY, 1981, 1981 P INT C PAR PRO, P170

[4]

ECKSTEIN DM, 1979, TR796 IOW STAT U COM

[5] COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS [J].

HIRSCHBERG, DS ;

CHANDRA, AK ;

SARWATE, DV .

COMMUNICATIONS OF THE ACM, 1979, 22 (08) :461-464

[6]

HIRSCHBERG DS, 1976, 8TH P ANN ACM S THEO, P55

[7]

SCHWARTZ JT, 1980, ACM T PROGRAMMING LA, V2, P848

[8] FINDING THE MAXIMUM, MERGING, AND SORTING IN A PARALLEL COMPUTATION MODEL [J].

SHILOACH, Y ;

VISHKIN, U .

JOURNAL OF ALGORITHMS, 1981, 2 (01) :88-102

[9] AN O(N2LOG N) PARALLEL MAX-FLOW ALGORITHM [J].

SHILOACH, Y ;

VISHKIN, U .

JOURNAL OF ALGORITHMS, 1982, 3 (02) :128-146

[10] AN O(LOG N) PARALLEL CONNECTIVITY ALGORITHM [J].

SHILOACH, Y ;

VISHKIN, U .

JOURNAL OF ALGORITHMS, 1982, 3 (01) :57-67

← 1 2 →