AN O(LOG N) PARALLEL CONNECTIVITY ALGORITHM

被引：323

作者：

SHILOACH, Y ^{[1
]}

VISHKIN, U ^{[1
]}

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,HAIFA,ISRAEL

来源：

JOURNAL OF ALGORITHMS | 1982年 / 3卷 / 01期

关键词：

D O I：

10.1016/0196-6774(82)90008-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：57 / 67

页数：11

共 50 条

[1] An O(log n log log n) space algorithm for undirected st-connectivity
Trifonov, Vladimir
SIAM JOURNAL ON COMPUTING, 2008, 38 (02) : 449 - 483
[2] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
KIM, T
CHWA, KY
INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
[3] AN 0(LOG-N) PARALLEL ALGORITHM FOR STRONG CONNECTIVITY AUGMENTATION PROBLEM
CHAUDHURI, P
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1987, 22 (3-4) : 187 - 197
[4] An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees
Asano, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (03) : 503 - 510
[5] AN OPTIMAL O(LOG LOG-N) TIME PARALLEL STRING MATCHING ALGORITHM
BRESLAUER, D
GALIL, Z
SIAM JOURNAL ON COMPUTING, 1990, 19 (06) : 1051 - 1058
[6] An O(log2N) parallel algorithm for output queuing
Prakash, A
Sharif, S
Aziz, A
IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 1623 - 1629
[7] Parallel O(log N) algorithm for dynamics simulation of humanoid robots
Yamane, Katsu
Nakamura, Yoshihiko
2006 6TH IEEE-RAS INTERNATIONAL CONFERENCE ON HUMANOID ROBOTS, VOLS 1 AND 2, 2006, : 554 - +
[8] An optimal O(log log N)-time parallel algorithm for detecting all squares in a string
Apostolico, A
Breslauer, D
SIAM JOURNAL ON COMPUTING, 1996, 25 (06) : 1318 - 1331
[9] AN O(N2LOG N) PARALLEL MAX-FLOW ALGORITHM
SHILOACH, Y
VISHKIN, U
JOURNAL OF ALGORITHMS, 1982, 3 (02) : 128 - 146
[10] AN O(LOG N) TIME PARALLEL ALGORITHM FOR TRIANGULATING A SET OF POINTS IN THE PLANE
WANG, CA
TSIN, YH
INFORMATION PROCESSING LETTERS, 1987, 25 (01) : 55 - 60

← 1 2 3 4 5 →