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 条
[31]   EFFICIENT ALGORITHMS FOR GRAPH MANIPULATION [J].
HOPCROFT, J ;
TARJAN, R .
COMMUNICATIONS OF THE ACM, 1973, 16 (06) :372-378
[32]   Deriving efficient graph algorithms [J].
Reif, JH ;
Scherlis, WL .
VERIFICATION: THEORY AND PRACTICE: ESSAYS DEDICATED TO ZHOAR MANNA ON THE OCCASION OF HIS 64TH BIRTHDAY, 2003, 2772 :645-681
[33]   EFFICIENT PARALLEL ALGORITHMS OF GRAPHS [J].
DJIDJEV, HN .
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1985, 38 (06) :687-689
[34]   GRAPH BISECTION ALGORITHMS WITH GOOD AVERAGE CASE BEHAVIOR [J].
BUI, TN ;
CHAUDHURI, S ;
LEIGHTON, FT ;
SIPSER, M .
COMBINATORICA, 1987, 7 (02) :171-191
[35]   Average-Case Analysis of Dynamic Graph Algorithms [J].
D. Alberts ;
M. R. Henzinger .
Algorithmica, 1998, 20 :31-60
[36]   Average-case analysis of dynamic graph algorithms [J].
Alberts, D ;
Henzinger, MR .
ALGORITHMICA, 1998, 20 (01) :31-60
[37]   Parallel updating algorithms for graph searching problems [J].
Chaudhuri, P .
JOURNAL OF SYSTEMS ARCHITECTURE, 1996, 42 (04) :315-325
[38]   Coarse grained parallel algorithms for graph matching [J].
Chan, Albert ;
Dehne, Frank ;
Bose, Prosenjit ;
Latzel, Markus .
PARALLEL COMPUTING, 2008, 34 (01) :47-62
[39]   Graph isomorphism and identification matrices: Parallel algorithms [J].
Chen, L .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (03) :308-319
[40]   Fast parallel algorithms for graph similarity and matching [J].
Kollias, Giorgos ;
Sathe, Madan ;
Schenk, Olaf ;
Grama, Ananth .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (05) :2400-2410
12345