ON EFFICIENT PARALLEL STRONG ORIENTATION

被引：37

作者：

VISHKIN, U ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,DEPT COMP SCI,NEW YORK,NY 10003

来源：

INFORMATION PROCESSING LETTERS | 1985年 / 20卷 / 05期

关键词：

* This research was supported by DOE Grant DE-AC02-76ER03077 and by NSF Grants DCR-8318874 and MCS79-21258. ** Present affiliation: Department of Computer Science; Tel Aviv University; Ramat Aviv; Tel Aviv 69978; Israel;

D O I：

10.1016/0020-0190(85)90025-0

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：235 / 240

页数：6

共 13 条

[1] SORTING IN C LOG N PARALLEL STEPS
AJTAI, M
KOMLOS, J
SZEMEREDI, E
[J]. COMBINATORICA, 1983, 3 (01) : 1 - 19
[2] PARALLEL STRONG ORIENTATION OF AN UNDIRECTED GRAPH
ATALLAH, MJ
[J]. INFORMATION PROCESSING LETTERS, 1984, 18 (01) : 37 - 39
[3] AWERBUCH B, 1983, 1983 P INT C PAR PRO
[4] CHIN FY, 1981, 1981 P INT C PAR PRO, P170
[5] DEPTH-1ST SEARCH IS INHERENTLY SEQUENTIAL
REIF, JH
[J]. INFORMATION PROCESSING LETTERS, 1985, 20 (05) : 229 - 234
[6] REIF JH, 1983, 15TH P ANN ACM S THE, P10
[7] AN O(LOG N) PARALLEL CONNECTIVITY ALGORITHM
SHILOACH, Y
VISHKIN, U
[J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 57 - 67
[8] Tarjan R., 1974, SIAM Journal on Computing, V3, P62, DOI 10.1137/0203006
[9] Tarjan R. E., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P12, DOI 10.1109/SFCS.1984.715896
[10] TARJAN RE, 1983, 69 NEW YORK U COUR I

← 1 2 →