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 条
  • [41] ON THE MAXIMUM WEIGHT INDEPENDENT SET PROBLEM IN GRAPHS WITHOUT INDUCED CYCLES OF LENGTH AT LEAST FIVE
    Chudnovsky, Maria
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Thomasse, Stephan
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (02) : 1472 - 1483
  • [42] Sticker model for maximum clique problem and maximum independent set
    Fan, Yue-Ke
    Qiang, Xiao-Li
    Xu, Jin
    [J]. Jisuanji Xuebao/Chinese Journal of Computers, 2010, 33 (02): : 305 - 310
  • [43] 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
  • [44] Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
    Stefan Dobrev
    Rastislav Královič
    Richard Královič
    [J]. Theory of Computing Systems, 2015, 56 : 197 - 219
  • [45] Maximum Independent Set on B1-VPG Graphs
    Lahiri, Abhiruk
    Mukherjee, Joydeep
    Subramanian, C. R.
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 633 - 646
  • [46] Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
    Dobrev, Stefan
    Kralovic, Rastislav
    Kralovic, Richard
    [J]. THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 197 - 219
  • [47] Maximum Independent Set in 2-Direction Outersegment Graphs
    Flier, Holger
    Mihalak, Matus
    Widmayer, Peter
    Zych, Anna
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011, 6986 : 155 - 166
  • [48] Computing A Near-Maximum Independent Set In Dynamic Graphs
    Zheng, Weiguo
    Piao, Chengzhi
    Cheng, Hong
    Yu, Jeffrey Xu
    [J]. 2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, : 76 - 87
  • [49] A note on maximum independent set and related problems on box graphs
    Lingas, A
    Wahlen, M
    [J]. INFORMATION PROCESSING LETTERS, 2005, 93 (04) : 169 - 171
  • [50] A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs
    Best, Darcy
    Ward, Max
    [J]. Journal of Graph Algorithms and Applications, 2022, 26 (01) : 199 - 205
12345