AN EFFICIENT PARALLEL BICONNECTIVITY ALGORITHM

被引：310

作者：

TARJAN, RE ^{[1
]}

VISHKIN, U ^{[1
]}

机构：

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

来源：

关键词：

D O I：

10.1137/0214061

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：862 / 874

页数：13

共 32 条

[1] ATALLAH M, UNPUB J COMP SYS SCI
[2] PARALLEL STRONG ORIENTATION OF AN UNDIRECTED GRAPH
ATALLAH, MJ
[J]. INFORMATION PROCESSING LETTERS, 1984, 18 (01) : 37 - 39
[3] AWERBUCH B, 1984, 16TH P ANN ACM S THE, P249
[4] Berge C., 1973, GRAPHS HYPERGRAPHS, V7
[5] BORODIN A, 1982, 14TH P ACM S THEOR C, P334
[6] CHIN FY, 1981, 1981 P INT C PAR PRO, P170
[7] ECKSTEIN DM, 1979, TR7911 IOW STAT U CO
[8] ECKSTEIN DM, 1979, TR796 IOW STAT U COM
[9] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
[10] COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS
HIRSCHBERG, DS
CHANDRA, AK
SARWATE, DV
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (08) : 461 - 464