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 条
  • [41] The Fine-Grained Complexity of Multi-Dimensional Ordering Properties
    Haozhe An
    Mohit Gurumukhani
    Russell Impagliazzo
    Michael Jaber
    Marvin Künnemann
    Maria Paula Parga Nina
    Algorithmica, 2022, 84 : 3156 - 3191
  • [42] Fine-grained parameterized complexity analysis of graph coloring problems
    Jaffke, Lars
    Jansen, Bart M. P.
    DISCRETE APPLIED MATHEMATICS, 2023, 327 : 33 - 46
  • [43] The fine-grained complexity of multi-dimensional ordering properties
    An, Haozhe
    Gurumukhani, Mohit
    Impagliazzo, Russell
    Jaber, Michael
    Künnemann, Marvin
    Nina, Maria Paula Parga
    Leibniz International Proceedings in Informatics, LIPIcs, 2021, 214
  • [44] The Fine-Grained and Parallel Complexity of Andersen's Pointer Analysis
    Mathiasen, Anders Alnor
    Pavlogiannis, Andreas
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2021, 5 (POPL):
  • [45] The Fine-Grained Complexity of Multi-Dimensional Ordering Properties
    An, Haozhe
    Gurumukhani, Mohit
    Impagliazzo, Russell
    Jaber, Michael
    Kuennemann, Marvin
    Nina, Maria Paula Parga
    ALGORITHMICA, 2022, 84 (11) : 3156 - 3191
  • [46] On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
    Nederlof, Jesper
    Swennenhuis, Celine M. F.
    ALGORITHMICA, 2022, 84 (08) : 2309 - 2334
  • [47] Improve Fine-Grained Feature Learning in Fine-Grained DataSet GAI
    Wang, Hai Peng
    Geng, Zhi Qing
    IEEE ACCESS, 2025, 13 : 12777 - 12788
  • [48] Leveraging Fine-Grained Labels to Regularize Fine-Grained Visual Classification
    Wu, Junfeng
    Yao, Li
    Liu, Bin
    Ding, Zheyuan
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON COMPUTER MODELING AND SIMULATION (ICCMS 2019) AND 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND APPLICATIONS (ICICA 2019), 2019, : 133 - 136
  • [49] Fine-grained parallel regular expression matching for deep packet inspection
    Liu, X. (xingkuiliu@ncic.ac.cn), 1600, Science Press (51):
  • [50] FINE-GRAINED MONOLITH
    Louw, Michael
    ARCHITECTURE SOUTH AFRICA, 2019, (96): : 48 - 49
12345