Classes of subcubic planar graphs for which the independent set problem is polynomially solvable

被引：8

作者：

Malyshev D.S. ^{[1
,2
]}

机构：

[1] National Research University Higher School of Economics at Nizhni Novgorod, B. Pecherskaya ul. 25/12, Nizhni Novgorod

[2] Nizhni Novgorod State University, ul. Gagarina 23

来源：

Journal of Applied and Industrial Mathematics | 2013年 / 7卷 / 4期

基金：

俄罗斯基础研究基金会;

关键词：

boundary class; computational complexity; efficient algorithm; independent set problem;

D O I：

10.1134/S199047891304008X

中图分类号：

学科分类号：

摘要：

引用

页码：537 / 548

页数：11

共 50 条

[1] Planar graph classes with the independent set problem solvable in polynomial time
Alekseev V.E.
Malyshev D.S.
[J]. Journal of Applied and Industrial Mathematics, 2009, 3 (1) : 1 - 4
[2] 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
[3] 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
[4] Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
Malyshev D.S.
Sirotkin D.V.
[J]. Journal of Applied and Industrial Mathematics, 2017, 11 (3) : 400 - 414
[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 TREE-ACHIEVING SET AND NON-SEPARATING INDEPENDENT SET PROBLEM OF SUBCUBIC GRAPHS
Cao, Fayun
Ren, Han
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023,
[7] POLYNOMIALLY SOLVABLE CASES FOR THE MAXIMUM STABLE SET PROBLEM
HERTZ, A
[J]. DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 195 - 210
[8] On the maximum independent set problem in subclasses of planar graphs
Lozin, Vadim
Milanič, Martin
[J]. Journal of Graph Algorithms and Applications, 2010, 14 (02) : 269 - 286
[9] THE MAXIMUM INDEPENDENT SET PROBLEM FOR CUBIC PLANAR GRAPHS
BURNS, JE
[J]. NETWORKS, 1989, 19 (03) : 373 - 378
[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 →