On the computational complexity of graph closures

被引：2
|
作者：
Monti, A
机构：
[1] Dipto. di Scienze dellInformazione, Univ. degli Studi di Roma, 00198 Roma
来源：
INFORMATION PROCESSING LETTERS | 1996年 / 57卷 / 06期
关键词：
computational complexity; graph closure; parallel complexity; P-completeness;
D O I：
10.1016/0020-0190(96)00027-0
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper resolves the parallel complexity of the graph closure problem, an open question posed by S. Khuller. In particular, we prove that the 2N - k-closure problem is in L for k = 5 and it is P-complete for k greater than or equal to 6. Finally, we show that the N + k-closure problem is P-complete for any integer k.
引用
收藏
页码：291 / 295
页数：5
相关论文
共 50 条
  • [1] On the computational complexity of dynamic graph problems
    Ramalingam, G
    Reps, T
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 158 (1-2) : 233 - 277
  • [2] Computational complexity of the graph approximation problem
    Ageev A.A.
    Il'ev V.P.
    Kononov A.V.
    Talevnin A.S.
    [J]. Journal of Applied and Industrial Mathematics, 2007, 1 (1) : 1 - 8
  • [3] On graph closures
    Kelmans, A
    [J]. DISCRETE MATHEMATICS, 2003, 271 (1-3) : 141 - 168
  • [4] A note on the computational complexity of graph vertex partition
    Huang, Yuanqiu
    Chub, Yuming
    [J]. DISCRETE APPLIED MATHEMATICS, 2007, 155 (03) : 405 - 409
  • [5] GRAPH-THEORETIC PROPERTIES IN COMPUTATIONAL COMPLEXITY
    VALIANT, LG
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 278 - 285
  • [6] On computational complexity of graph inference from counting
    Fazekas, Szilard Zsolt
    Ito, Hiro
    Okuno, Yasushi
    Seki, Shinnosuke
    Taneishi, Kei
    [J]. NATURAL COMPUTING, 2013, 12 (04) : 589 - 603
  • [7] On computational complexity of graph inference from counting
    Szilárd Zsolt Fazekas
    Hiro Ito
    Yasushi Okuno
    Shinnosuke Seki
    Kei Taneishi
    [J]. Natural Computing, 2013, 12 : 589 - 603
  • [8] ON COMPUTING GRAPH CLOSURES
    KHULLER, S
    [J]. INFORMATION PROCESSING LETTERS, 1989, 31 (05) : 249 - 255
  • [9] A computational complexity comparative study of graph tessellation problems
    Abreu, Alexandre
    Cunha, Luis
    Figueiredo, Celina de
    Kowada, Luis
    Marquezino, Franklin
    Portugal, Renato
    Posner, Daniel
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 858 : 81 - 89
  • [10] Evolving Graph-Structures and Their Implicit Computational Complexity
    Leivant, Daniel
    Marion, Jean-Yves
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 349 - 360
12345