ISOMORPHISM TESTING OF K-TREES IS IN NC, FOR FIXED-K

被引：4

|

作者：

CHANDRASEKHARAN, N ^{[1
]}

机构：

[1] CLEMSON UNIV,DEPT MATH SCI,CLEMSON,SC 29634

来源：

INFORMATION PROCESSING LETTERS | 1990年 / 34卷 / 06期

关键词：

computational complexity; isomorphism; k-trees; Parallel algorithms;

D O I：

10.1016/0020-0190(90)90011-L

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

收藏

页码：283 / 287

页数：5

相关论文

共 50 条

[1] Fast parallel reordering and isomorphism testing of k-trees
Del Greco, JG
Sekharan, CN
Sridhar, R
ALGORITHMICA, 2002, 32 (01) : 61 - 72
[2] The isomorphism problem for k-trees is complete for logspace
Arvind, V.
Das, Bireswar
Koebler, Johannes
Kuhnert, Sebastian
INFORMATION AND COMPUTATION, 2012, 217 : 1 - 11
[3] The Isomorphism Problem for k-Trees Is Complete for Logspace
Koebler, Johannes
Kuhnert, Sebastian
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 537 - 548
[4] TESTING SUPERPERFECTION OF K-TREES
KLOKS, T
BODLAENDER, H
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 292 - 303
[5] Faster algorithms for subgraph isomorphism of k-connected partial k-trees
Dessmark, A
Lingas, A
Proskurowski, A
ALGORITHMICA, 2000, 27 (3-4) : 337 - 347
[6] The complexity of subgraph isomorphism for classes of partial k-trees
Gupta, A
Nishimura, N
THEORETICAL COMPUTER SCIENCE, 1996, 164 (1-2) : 287 - 298
[7] ON SOME OPTIMIZATION PROBLEMS ON K-TREES AND PARTIAL K-TREES
GRANOT, D
SKORINKAPOV, D
DISCRETE APPLIED MATHEMATICS, 1994, 48 (02) : 129 - 145
[8] On some optimization problems on K-trees and partial k-trees
1600, (48):
[9] POLYNOMIAL ALGORITHMS FOR GRAPH ISOMORPHISM AND CHROMATIC INDEX ON PARTIAL K-TREES
BODLAENDER, HL
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 223 - 232
[10] On a characterization of k-trees
Zeng, De-Yan
Yin, Jian-Hua
CZECHOSLOVAK MATHEMATICAL JOURNAL, 2015, 65 (02) : 361 - 365

← 1 2 3 4 5 →