THE CRITICAL COMPLEXITY OF GRAPH PROPERTIES

被引:29
|
作者
TURAN, G
机构
关键词
D O I
10.1016/0020-0190(84)90019-X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:151 / 153
页数:3
相关论文
共 50 条
  • [31] The Complexity of Growing a Graph
    Mertzios, George B.
    Michail, Othon
    Skretas, George
    Spirakis, Paul G.
    Theofilatos, Michail
    ALGORITHMICS OF WIRELESS NETWORKS, ALGOSENSORS 2022, 2022, 13707 : 123 - 137
  • [32] ON THE COMPLEXITY OF GRAPH RECONSTRUCTION
    KRATSCH, D
    HEMACHANDRA, LA
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 318 - 328
  • [33] Remarks on graph complexity
    Lokam, SV
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1998, 1530 : 307 - 318
  • [34] The complexity of growing a graph ☆
    Mertzios, George
    Michail, Othon
    Skretas, George
    Spirakis, Paul G.
    Theofilatos, Michail
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 147
  • [35] The complexity of graph pebbling
    Milans, Kevin
    Clark, Bryan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (03) : 769 - 798
  • [36] THE COMPLEXITY OF GRAPH CONNECTIVITY
    WIGDERSON, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 112 - 132
  • [37] On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
    Fomin, Fedor V.
    Golovach, Petr A.
    Thilikos, Dimitrios M.
    Theory of Computing Systems, 2020, 64 (02): : 251 - 271
  • [38] Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
    Eppstein, David
    Gupta, Siddharth
    Havvaei, Elham
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 217 - 229
  • [39] On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
    Fedor V. Fomin
    Petr A. Golovach
    Dimitrios M. Thilikos
    Theory of Computing Systems, 2020, 64 : 251 - 271
  • [40] On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
    Fomin, Fedor V.
    Golovach, Petr A.
    Thilikos, Dimitrios M.
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (02) : 251 - 271