A note on the fine-grained complexity of MIS on regular graphs

被引：0
|
作者：
Amiri, Saeed Akhoondian [1 ]
机构：
[1] Univ Cologne, Dept Comp Sci, Cologne, Germany
来源：
INFORMATION PROCESSING LETTERS | 2021年 / 170卷
关键词：
ETH; NP-complete; Independent set; Planar graphs; Computational complexity; MAXIMUM INDEPENDENT SET; P-T-FREE; TIME ALGORITHM;
D O I：
10.1016/j.ipl.2021.106123
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs, unless ETH fails. We expand our method to show that it helps to provide lowerbounds for other covering problems such as vertex cover and clique. We utilize the construction to show the NP-hardness of MIS on 5-regular planar graphs, closing the exact complexity status of the problem on regular planar graphs. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数：5
相关论文
共 50 条
  • [1] A note on the fine-grained complexity of MIS on regular graphs
    Akhoondian Amiri, Saeed
    Information Processing Letters, 2021, 170
  • [2] Fine-Grained Complexity for Sparse Graphs
    Agarwal, Udit
    Ramachandran, Vijaya
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 239 - 252
  • [3] FINE-GRAINED COMPLEXITY OF REGULAR PATH QUERIES
    Casel, Katrin
    Schmid, Markus l.
    LOGICAL METHODS IN COMPUTER SCIENCE, 2023, 19 (04)
  • [4] Fine-Grained Complexity Theory
    Bringmann, Karl
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [5] Fine-Grained Algorithms and Complexity
    Williams, Virginia Vassilevska
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [6] On the Fine-Grained Complexity of Approximating k-Center in Sparse Graphs
    Abboud, Amir
    Cohen-Addad, Vincent
    Lee, Euiwoong
    Manurangsi, Pasin
    2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 145 - 155
  • [7] Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
    Okrasa, Karolina
    Rzazewski, Pawel
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1578 - 1590
  • [8] Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
    Okrasa, Karolina
    Rzazewski, Pawel
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1578 - 1590
  • [9] The Fine-Grained Complexity of CFL Reachability
    Koutris, Paraschos
    Deep, Shaleen
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL):
  • [10] Fine-Grained Complexity of Safety Verification
    Chini, Peter
    Meyer, Roland
    Saivasan, Prakash
    JOURNAL OF AUTOMATED REASONING, 2020, 64 (07) : 1419 - 1444
12345