PARALLEL GRAPH ALGORITHMS THAT ARE EFFICIENT ON AVERAGE

被引：6
作者：
COPPERSMITH, D
RAGHAVAN, P
TOMPA, M
机构：
来源：
INFORMATION AND COMPUTATION | 1989年 / 81卷 / 03期
关键词：
D O I：
10.1016/0890-5401(89)90035-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：318 / 333
页数：16
相关论文
共 50 条
[21]   EFFICIENT ALGORITHMS FOR SOME GRAPH PROBLEMS ON A TREE-STRUCTURED PARALLEL COMPUTER [J].
CHAUDHURI, P .
INTERNATIONAL JOURNAL OF ELECTRONICS, 1987, 62 (04) :599-615
[22]   Parallel algorithms constructing the cell graph [J].
Kaczmarski, Krzysztof ;
Rzazewski, Pawel ;
Wolant, Albert .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2017, 29 (23)
[23]   PARALLEL GRAPH ALGORITHMS FOR HYPERCUBE COMPUTERS [J].
DAS, SK ;
DEO, N ;
PRASAD, S .
PARALLEL COMPUTING, 1990, 13 (02) :143-158
[24]   Parallel Algorithms for Geometric Graph Problems [J].
Andoni, Alexandr ;
Nikolov, Aleksandar ;
Onak, Krzysztof ;
Yaroslavtsev, Grigory .
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, :574-583
[25]   SUCCESSIVE APPROXIMATION IN PARALLEL GRAPH ALGORITHMS [J].
FUSSELL, D ;
THURIMELLA, R .
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 :205-217
[26]   Scalable parallel graph coloring algorithms [J].
Gebremedhin, AH ;
Manne, F .
CONCURRENCY-PRACTICE AND EXPERIENCE, 2000, 12 (12) :1131-1146
[27]   PARALLEL ALGORITHMS FOR CONNECTED COMPONENTS IN A GRAPH [J].
KOUBEK, V ;
KRSNAKOVA, J .
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 :208-217
[28]   Expediting Parallel Graph Connectivity Algorithms [J].
Wadwekar, Mihir ;
Kothapalli, Kishore .
2018 IEEE 25TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2018, :72-81
[29]   Parallel algorithms for finding cliques in a graph [J].
Szabo, S. .
5TH INTERNATIONAL WORKSHOP ON MULTI-RATE PROCESSES AND HYSTERESIS (MURPHYS 2010), 2010, 268
[30]   SUCCESSIVE APPROXIMATION IN PARALLEL GRAPH ALGORITHMS [J].
FUSSELL, D ;
THURIMELLA, R .
THEORETICAL COMPUTER SCIENCE, 1990, 74 (01) :19-35
12345