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
相关论文
共 14 条
  • [1] PROPERTIES AND CHARACTERIZATIONS OF K-TREES
    BEINEKE, LW
    PIPPERT, RE
    [J]. MATHEMATIKA, 1971, 18 (35) : 141 - &
  • [2] BODLAENDER HL, 1987, RUUCS8717 U UTR DEP
  • [3] BOOTH KS, 1979, 7704 U WAT DEP COMP
  • [4] Cole R., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P511, DOI 10.1109/SFCS.1986.41
  • [5] FILOTTI IS, 1980, 12TH P ACM S THEOR C, P236
  • [6] HOPCROFT JE, 1968, 21ST P ANN IEEE S F, V15, P115
  • [7] ISOMORPHISM TESTING IN HOOKUP CLASSES
    KLAWE, MM
    CORNEIL, DG
    PROSKUROWSKI, A
    [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 260 - 274
  • [8] Klein P. N., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P150, DOI 10.1109/SFCS.1988.21933
  • [9] LINEAR TIME ALGORITHM FOR DECIDING INTERVAL GRAPH ISOMORPHISM
    LUEKER, GS
    BOOTH, KS
    [J]. JOURNAL OF THE ACM, 1979, 26 (02) : 183 - 195
  • [10] Luks E. M., 1980, 21st Annual Symposium on Foundations of Computer Science, P42, DOI 10.1109/SFCS.1980.24
12