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

被引:4
|
作者
CHANDRASEKHARAN, N [1 ]
机构
[1] CLEMSON UNIV,DEPT MATH SCI,CLEMSON,SC 29634
关键词
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 条
  • [41] Fixed-k Inference for Conditional Extremal Quantiles
    Sasaki, Yuya
    Wang, Yulong
    JOURNAL OF BUSINESS & ECONOMIC STATISTICS, 2022, 40 (02) : 829 - 837
  • [42] EFFICIENT SETS IN PARTIAL K-TREES
    TELLE, JA
    PROSKUROWSKI, A
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 109 - 117
  • [43] Generation of K-trees of undirected graphs
    Patvardhan, C
    Prasad, VC
    Pyara, VP
    IEEE TRANSACTIONS ON RELIABILITY, 1997, 46 (02) : 208 - 211
  • [44] Independence Number and k-Trees of Graphs
    Yan, Zheng
    GRAPHS AND COMBINATORICS, 2017, 33 (05) : 1089 - 1093
  • [45] On maximum Estrada indices of k-trees
    Huang, Fei
    Wang, Shujing
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 487 : 316 - 327
  • [46] On the signless Laplacian spectra of k-trees
    Zhang, Minjie
    Li, Shuchao
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 467 : 136 - 148
  • [47] Independence Number and k-Trees of Graphs
    Zheng Yan
    Graphs and Combinatorics, 2017, 33 : 1089 - 1093
  • [48] Spanning k-trees of Bipartite Graphs
    Kano, Mikio
    Ozeki, Kenta
    Suzuki, Kazuhiro
    Tsugaki, Masao
    Yamashit, Tomoki
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
  • [50] The degree distribution of random k-trees
    Gao, Yong
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 688 - 695