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
中图分类号：
学科分类号：
摘要：
We prove the polynomial solvability of the independent set problem for some family of classes of the planar subcubic graphs. © 2013 Pleiades Publishing, Ltd.
引用
收藏
页码：537 / 548
页数：11
相关论文
共 50 条
  • [21] Boundary classes of graphs for the dominating set problem
    Alekseev, VE
    Korobitsyn, DV
    Lozin, VV
    [J]. DISCRETE MATHEMATICS, 2004, 285 (1-3) : 1 - 6
  • [22] AN ALGORITHM FOR FINDING A LARGE INDEPENDENT SET IN PLANAR GRAPHS
    CHIBA, N
    NISHIZEKI, T
    SAITO, N
    [J]. NETWORKS, 1983, 13 (02) : 247 - 252
  • [23] Two classes of graphs in which some problems related to convexity are efficiently solvable
    Moscarini, Marina
    Malvestuto, Francesco M.
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (03)
  • [24] On the complexity of the independent set problem in triangle graphs
    Orlovich, Yury
    Blazewicz, Jacek
    Dolgui, Alexandre
    Finke, Gerd
    Gordon, Valery
    [J]. DISCRETE MATHEMATICS, 2011, 311 (16) : 1670 - 1680
  • [25] NP-Completeness of the Independent Dominating Set Problem in the Class of Cubic Planar Bipartite Graphs
    Loverov Y.A.
    Orlovich Y.L.
    [J]. Journal of Applied and Industrial Mathematics, 2020, 14 (02): : 353 - 368
  • [26] Computational study on dominating set problem of planar graphs
    Marzban, Marjan
    Gu, Qian-Ping
    Jia, Xiaohua
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 89 - 102
  • [27] THE COLORING AND MAXIMUM INDEPENDENT SET PROBLEMS ON PLANAR PERFECT GRAPHS
    HSU, WL
    [J]. JOURNAL OF THE ACM, 1988, 35 (03) : 535 - 563
  • [28] On approximability of the independent set problem for low degree graphs
    Chlebík, M
    Chlebíková, J
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDING, 2004, 3104 : 47 - 56
  • [29] THE WEIGHTED MAXIMUM INDEPENDENT SET PROBLEM IN PERMUTATION GRAPHS
    YU, CW
    CHEN, GH
    [J]. BIT NUMERICAL MATHEMATICS, 1992, 32 (04) : 609 - 618
  • [30] ON THE NONSEPARATING INDEPENDENT SET PROBLEM AND FEEDBACK SET PROBLEM FOR GRAPHS WITH NO VERTEX DEGREE EXCEEDING 3
    UENO, S
    KAJITANI, Y
    GOTOH, S
    [J]. DISCRETE MATHEMATICS, 1988, 72 (1-3) : 355 - 360
12345