On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree

被引：0

作者：

Le, Ngoc C. ^{[1
,2
]}

Trung Tran ^{[1
]}

机构：

[1] Hanoi Univ Sci & Technol, Sch Appl Math & Informat, 1 Dai Co Viet Str, Hanoi, Vietnam

[2] Vietnam Acad Sci & Technol, Inst Math, Cau Giay, Vietnam

来源：

ACTA MATHEMATICA VIETNAMICA | 2020年 / 45卷 / 02期

关键词：

Maximum independent set; Stable set; Low degree graph;

D O I：

10.1007/s40306-020-00368-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We consider the maximum independent set (MIS) problem, i.e., the problem asking for a vertex subset of maximum cardinality of a graph such that no two vertices in this set are adjacent. The problem is known to be NP-hard in general, even if restricted on graphs of maximum degree at most Delta for a given integer Delta >= 3, i.e., every vertex is of degree at most Delta. We try to figure out some bounded maximum degree graph classes, under which the problem can be solved in polynomial time.

引用

页码：463 / 475

页数：13

共 50 条

[1] On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree
Ngoc C. Lê
Trung Tran
[J]. Acta Mathematica Vietnamica, 2020, 45 : 463 - 475
[2] PTAS for maximum weight independent set problem with random weights in bounded degree graphs
Gamarnik, David
Goldberg, David
Weber, Theophane
[J]. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 268 - 278
[3] Independent domination of graphs with bounded maximum degree
Cho, Eun-Kyung
Kim, Jinha
Kim, Minki
Oum, Sang-il
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 158 : 341 - 352
[4] On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
Chen, Min
Yu, Weiqiang
Wang, Weifan
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2018, 326 : 117 - 123
[5] The maximum independent set problem in planar graphs
Alekseev, Vladimir E.
Lozin, Vadim
Malyshev, Dmitriy
Milanic, Martin
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 96 - +
[6] THE WEIGHTED MAXIMUM INDEPENDENT SET PROBLEM IN PERMUTATION GRAPHS
YU, CW
CHEN, GH
[J]. BIT NUMERICAL MATHEMATICS, 1992, 32 (04) : 609 - 618
[7] On the maximum independent set problem in subclasses of subcubic graphs
Lozin, Vadim
Monnot, Jerome
Ries, Bernard
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2015, 31 : 104 - 112
[8] THE MAXIMUM INDEPENDENT SET PROBLEM FOR CUBIC PLANAR GRAPHS
BURNS, JE
[J]. NETWORKS, 1989, 19 (03) : 373 - 378
[9] The Maximum Independent Set Problem in Subclasses of Subcubic Graphs
Brause, Christoph
Ngoc Chi Le
Schiermeyer, Ingo
[J]. DISCRETE MATHEMATICS, 2015, 338 (10) : 1766 - 1778
[10] Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
Razgon, Igor
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (02) : 191 - 212

← 1 2 3 4 5 →