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 条

[31] Advice Complexity of Fine-Grained Job Shop Scheduling
Wehner, David
ALGORITHMS AND COMPLEXITY (CIAC 2015), 2015, 9079 : 416 - 428
[32] FINE-GRAINED COMPLEXITY OF COLORING UNIT DISKS AND BALLS
Biro, Csaba
Bonnet, Edouard
Marx, Daniel
Miltzow, Tillmann
Rzazewski, Pawel
JOURNAL OF COMPUTATIONAL GEOMETRY, 2018, 9 (02) : 47 - 80
[33] A Note on the Determination of Plastic Limit of Fine-Grained Soils
Prakash, K.
Sridharan, A.
Prasanna, H. S.
GEOTECHNICAL TESTING JOURNAL, 2009, 32 (04): : 372 - 374
[34] A fine-grained block ILU scheme on regular structures for GPGPUs
Luo, Lixiang
Edwards, Jack R.
Luo, Hong
Mueller, Frank
COMPUTERS & FLUIDS, 2015, 119 : 149 - 161
[35] FINE-GRAINED COLOUR DISCRIMINATION WITHOUT FINE-GRAINED COLOUR
Gert, Joshua
AUSTRALASIAN JOURNAL OF PHILOSOPHY, 2015, 93 (03) : 602 - 605
[36] Fine-Grained Multimodal DeepFake Classification via Heterogeneous Graphs
Yin, Qilin
Lu, Wei
Cao, Xiaochun
Luo, Xiangyang
Zhou, Yicong
Huang, Jiwu
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2024, 132 (11) : 5255 - 5269
[37] Fine-Grained Open Learner Models: Complexity Versus Support
Guerra-Hollstein, Julio
Barria-Pineda, Jordan
Schunn, Christian D.
Bull, Susan
Brusilovsky, Peter
PROCEEDINGS OF THE 25TH CONFERENCE ON USER MODELING, ADAPTATION AND PERSONALIZATION (UMAP'17), 2017, : 41 - 49
[38] Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
Jaffke, Lars
Jansen, Bart M. P.
ALGORITHMS AND COMPLEXITY (CIAC 2017), 2017, 10236 : 345 - 356
[39] Fine-grained Complexity Analysis of Two Classic TSP Variants
de Berg, Mark
Buchin, Kevin
Jansen, Bart M. P.
Woeginger, Gerhard
ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (01)
[40] On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Jesper Nederlof
Céline M. F. Swennenhuis
Algorithmica, 2022, 84 : 2309 - 2334

← 1 2 3 4 5 →