TESTING ISOMORPHISM OF OUTERPLANAR GRAPHS IN PARALLEL

被引：0

|

作者：

CHLEBUS, BS

DIKS, K

RADZIK, T

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 324卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：220 / 230

页数：11

相关论文

共 50 条

[1] OPTIMAL PARALLEL ALGORITHMS FOR TESTING ISOMORPHISM OF TREES AND OUTERPLANAR GRAPHS
LEVCOPOULOS, C
LINGAS, A
PETERSSON, O
RYTTER, W
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 472 : 204 - 214
[2] An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
Ku, SC
Wang, BF
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2002, 62 (02) : 221 - 227
[3] A simple O(log N) time parallel algorithm for testing isomorphism of maximal outerplanar graphs
Sen Gupta, S
Sinha, BP
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1999, 56 (02) : 144 - 155
[4] Parallel algorithm for testing isomorphism of undirected graphs
Chen, Ling
Yin, Xinchun
[J]. Jisuanji Gongcheng/Computer Engineering, 2002, 28 (06):
[5] LINEAR ALGORITHMS FOR ISOMORPHISM OF MAXIMAL OUTERPLANAR GRAPHS
BEYER, T
JONES, W
MITCHELL, S
[J]. JOURNAL OF THE ACM, 1979, 26 (04) : 603 - 610
[6] THE SUBGRAPH ISOMORPHISM-PROBLEM FOR OUTERPLANAR GRAPHS
SYSLO, MM
[J]. THEORETICAL COMPUTER SCIENCE, 1982, 17 (01) : 91 - 97
[7] PARALLEL RECOGNITION OF OUTERPLANAR GRAPHS
DIKS, K
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 269 : 105 - 113
[8] SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME
LINGAS, A
[J]. THEORETICAL COMPUTER SCIENCE, 1989, 63 (03) : 295 - 302
[9] SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME
LINGAS, A
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 210 : 98 - 103
[10] ON TESTING ISOMORPHISM OF PERMUTATION GRAPHS
COLBOURN, CJ
[J]. NETWORKS, 1981, 11 (01) : 13 - 21

← 1 2 3 4 5 →