The maximum independent set problem in planar graphs

被引：0

作者：

Alekseev, Vladimir E. ^{[1
]}

Lozin, Vadim ^{[2
]}

Malyshev, Dmitriy ^{[1
,3
]}

Milanic, Martin ^{[4
]}

机构：

[1] Nizhny Novgorod Univ, Dept Computat Math, Nizhnii Novgorod, Russia

[2] Univ Warwick, DIMAP & Math Inst, Coventry CV4 7ALQ, W Midlands, England

[3] Nizhny Novgorod Univ, Dept Comp Sci, Nizhnii Novgorod, Russia

[4] Bielefeld Univ, AG Genominformatik Fac Technol, Bielefeld, Germany

来源：

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS | 2008年 / 5162卷

关键词：

maximum independent set problem; planar graphs; hereditary classes;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the computational complexity of finding a maximum independent set of vertices in a planar graph. In general, this problem is known to be NP-hard. However, under certain restrictions it becomes polynomial-time solvable. We identify a graph parameter to which the complexity of the problem is sensible and produce a number of both negative (intractable) and positive (solvable in polynomial time) results, generalizing several known facts.

引用

页码：96 / +

页数：3

共 50 条

[1] THE MAXIMUM INDEPENDENT SET PROBLEM FOR CUBIC PLANAR GRAPHS
BURNS, JE
[J]. NETWORKS, 1989, 19 (03) : 373 - 378
[2] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM ON PLANAR GRAPHS
CHIBA, N
NISHIZEKI, T
SAITO, N
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (04) : 663 - 675
[3] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM IN CUBIC PLANAR GRAPHS
CHOUKHMANE, E
FRANCO, J
[J]. NETWORKS, 1986, 16 (04) : 349 - 356
[4] 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
[5] On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree
Le, Ngoc C.
Trung Tran
[J]. ACTA MATHEMATICA VIETNAMICA, 2020, 45 (02) : 463 - 475
[6] THE COLORING AND MAXIMUM INDEPENDENT SET PROBLEMS ON PLANAR PERFECT GRAPHS
HSU, WL
[J]. JOURNAL OF THE ACM, 1988, 35 (03) : 535 - 563
[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 WEIGHTED MAXIMUM INDEPENDENT SET PROBLEM IN PERMUTATION GRAPHS
YU, CW
CHEN, GH
[J]. BIT NUMERICAL MATHEMATICS, 1992, 32 (04) : 609 - 618
[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] Approximability of the distance independent set problem on regular graphs and planar graphs
Eto, Hiroshi
Ito, Takehiro
Liu, Zhilong
Miyano, Eiji
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2022, E105 (08)

← 1 2 3 4 5 →