THE CRITICAL COMPLEXITY OF GRAPH PROPERTIES

被引：29
|
作者：
TURAN, G
机构：
来源：
INFORMATION PROCESSING LETTERS | 1984年 / 18卷 / 03期
关键词：
D O I：
10.1016/0020-0190(84)90019-X
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：151 / 153
页数：3
相关论文
共 50 条
  • [21] Decision tree complexity of graph properties with dimension at most 5
    Suixiang Gao
    Guohui Lin
    Journal of Computer Science and Technology, 2000, 15 : 416 - 422
  • [22] Decision tree complexity of graph properties with dimension at most 5
    Gao, SX
    Lin, GH
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2000, 15 (05) : 416 - 422
  • [23] The complexity of graph contractions
    Levin, A
    Paulusma, D
    Woeginger, GJ
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 322 - 333
  • [24] THE COMPLEXITY OF SEARCHING A GRAPH
    MEGIDDO, N
    HAKIMI, SL
    GAREY, MR
    JOHNSON, DS
    PAPADIMITRIOU, CH
    JOURNAL OF THE ACM, 1988, 35 (01) : 18 - 44
  • [25] ON THE COMPLEXITY OF GRAPH MANIFOLDS
    Fominykh, E.
    Ovchinnikov, M.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2005, 2 : 190 - 191
  • [26] Spectral Graph Complexity
    Tsitsulin, Anton
    Mottin, Davide
    Karras, Panagiotis
    Bronstein, Alex
    Mueller, Emmanuel
    COMPANION OF THE WORLD WIDE WEB CONFERENCE (WWW 2019 ), 2019, : 308 - 309
  • [27] ON THE COMPLEXITY OF GRAPH RECONSTRUCTION
    KRATSCH, D
    HEMASPAANDRA, LA
    MATHEMATICAL SYSTEMS THEORY, 1994, 27 (03): : 257 - 273
  • [28] THE COMPLEXITY OF PURSUIT ON A GRAPH
    GOLDSTEIN, AS
    REINGOLD, EM
    THEORETICAL COMPUTER SCIENCE, 1995, 143 (01) : 93 - 112
  • [29] The linear complexity of a graph
    Neel, DL
    Orrison, ME
    ELECTRONIC JOURNAL OF COMBINATORICS, 2006, 13 (01):
  • [30] Complexity of pursuit on a graph
    Goldstein, A.S.
    Reingold, E.M.
    Theoretical Computer Science, 1995, 143 (01):
12345