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

被引：2
|
作者：
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 条
  • [21] A Fine-grained Access Control Model for Knowledge Graphs
    Valzelli, Marco
    Maurino, Andrea
    Palmonari, Matteo
    PROCEEDINGS OF THE 17TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS (SECRYPT), VOL 1, 2020, : 595 - 601
  • [22] Scaling Fine-grained Modularity Clustering for Massive Graphs
    Shiokawa, Hiroaki
    Amagasa, Toshiyuki
    Kitagawa, Hiroyuki
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 4597 - 4604
  • [23] Fine-grained complexity of rainbow coloring and its variants
    Agrawal, Akanksha
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 124 : 140 - 158
  • [24] Towards a Fine-grained Analysis of Complexity of Programming Tasks
    Duran, Rodrigo
    PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH (ICER 17), 2017, : 271 - 272
  • [25] Manipulating Districts to Win Elections: Fine-Grained Complexity
    Eiben, Eduard
    Fomin, Fedor, V
    Panolan, Fahad
    Simonov, Kirill
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1902 - 1909
  • [26] Learning the Kalman Filter with Fine-Grained Sample Complexity
    Zhang, Xiangyuan
    Hu, Bin
    Basar, Tamer
    2023 AMERICAN CONTROL CONFERENCE, ACC, 2023, : 4549 - 4554
  • [27] Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming
    Alman, Josh
    Turok, Ethan
    Yu, Hantao
    Zhang, Hengzhi
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [28] Multivariate Fine-Grained Complexity of Longest Common Subsequence
    Bringmann, Karl
    Kuennemann, Marvin
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1216 - 1235
  • [29] Fine-Grained Time Complexity of Constraint Satisfaction Problems
    Jonsson, Peter
    Lagerkvist, Victor
    Roy, Biman
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2021, 13 (01)
  • [30] On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem
    Klein, Kim-Manuel
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 3567 - 3582
12345