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 条
  • [21] A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
    Trejo-Sanchez, Joel Antonio
    Madera-Ramirez, Francisco A.
    Alberto Fernandez-Zepeda, Jose
    Luis Lopez-Martinez, Jose
    Flores-Lamas, Alejandro
    [J]. OPTIMIZATION LETTERS, 2023, 17 (06) : 1435 - 1454
  • [22] On the independent set problem in random graphs
    Song, Yinglei
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2015, 92 (11) : 2233 - 2242
  • [23] Maximum independent set and maximum clique algorithms for overlap graphs
    Cenek, E
    Stewart, L
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 77 - 91
  • [24] 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
  • [25] The 0-1 inverse maximum independent set problem on forests and unicyclic graphs
    Liu, Shuaifu
    Zhang, Zhao
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (02)
  • [26] A new simple algorithm for the maximum-weight independent set problem on circle graphs
    Valiente, G
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 129 - 137
  • [27] SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE MAXIMUM-WEIGHT INDEPENDENT SET PROBLEM ON PERMUTATION GRAPHS
    YU, MS
    TSENG, LY
    CHANG, SJ
    [J]. INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 7 - 11
  • [28] Graphs with a unique maximum independent set up to automorphisms
    Bresar, Bostjan
    Dravec, Tanja
    Gorzkowska, Aleksandra
    Kleszcz, Elzbieta
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 317 : 124 - 135
  • [29] Algorithms for Maximum Independent Set in Convex Bipartite Graphs
    Soares, Jose
    Stefanes, Marco A.
    [J]. ALGORITHMICA, 2009, 53 (01) : 35 - 49
  • [30] Algorithms for Maximum Independent Set in Convex Bipartite Graphs
    José Soares
    Marco A. Stefanes
    [J]. Algorithmica, 2009, 53 : 35 - 49
12345