PARALLEL ALGORITHMS FOR CONNECTED COMPONENTS IN A GRAPH

被引：0
作者：
KOUBEK, V
KRSNAKOVA, J
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 199卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：208 / 217
页数：10
相关论文
共 19 条
[1]  
Ajtai Miklos, 1983, P 15 ANN ACM S THEOR, P1
[2]  
Berge C., 1965, PROGRAMMING GAMES TR
[3]  
Berge C., 1973, GRAPHS HYPERGRAPHS, V7
[4]   EFFICIENT PARALLEL ALGORITHMS FOR SOME GRAPH PROBLEMS [J].
CHIN, FY ;
LAM, J ;
CHEN, IN .
COMMUNICATIONS OF THE ACM, 1982, 25 (09) :659-665
[5]   A UNIVERSAL INTERCONNECTION PATTERN FOR PARALLEL COMPUTERS [J].
GOLDSCHLAGER, LM .
JOURNAL OF THE ACM, 1982, 29 (04) :1073-1086
[6]   COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS [J].
HIRSCHBERG, DS ;
CHANDRA, AK ;
SARWATE, DV .
COMMUNICATIONS OF THE ACM, 1979, 22 (08) :461-464
[7]  
HIRSCHBERG DS, 1976, 8TH P ANN ACM S THEO, P55
[8]  
KOUBEK V, 1984, SOFSEM 84, P326
[9]   PARALLEL COMPUTATION AND CONFLICTS IN MEMORY ACCESS [J].
KUCERA, L .
INFORMATION PROCESSING LETTERS, 1982, 14 (02) :93-96
[10]   PARALLEL PREFIX COMPUTATION [J].
LADNER, RE ;
FISCHER, MJ .
JOURNAL OF THE ACM, 1980, 27 (04) :831-838
12