Exact Algorithms for Maximum Independent Set

被引：0
|
作者：
Xiao, Mingyu [1 ]
Nagamochi, Hiroshi [2 ]
机构：
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Beijing, Peoples R China
[2] Kyoto Univ, Grad Sch Informat, Dept Appl Math & Phys, Kyoto 6068501, Japan
来源：
ALGORITHMS AND COMPUTATION | 2013年 / 8283卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that the maximum independent set problem (MIS) on an n-vertex graph can be solved in 1.2002(n) n(O(1)) time and polynomial space, which is even faster than Robson's 1.2109(n)n(O(1))-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7. Our algorithms are obtained by effectively using fast algorithms for MIS in low-degree graphs and making careful analyses for MIS in high-degree graphs.
引用
收藏
页码：328 / 338
页数：11
相关论文
共 50 条
  • [1] Exact algorithms for maximum independent set
    Xiao, Mingyu
    Nagamochi, Hiroshi
    INFORMATION AND COMPUTATION, 2017, 255 : 126 - 146
  • [2] Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract)
    Huang, Sen
    Xiao, Mingyu
    Chen, Xiaoyu
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 617 - 628
  • [3] Iterative quantum algorithms for maximum independent set
    Brady, Lucas T.
    Hadfield, Stuart
    PHYSICAL REVIEW A, 2024, 110 (05)
  • [4] Maximum independent set and maximum clique algorithms for overlap graphs
    Cenek, E
    Stewart, L
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 77 - 91
  • [5] Conversion of coloring algorithms into maximum weight independent set algorithms
    Erlebach, T
    Jansen, K
    DISCRETE APPLIED MATHEMATICS, 2005, 148 (01) : 107 - 125
  • [6] Algorithms for Maximum Independent Set in Convex Bipartite Graphs
    José Soares
    Marco A. Stefanes
    Algorithmica, 2009, 53 : 35 - 49
  • [7] Algorithms for Maximum Independent Set in Convex Bipartite Graphs
    Soares, Jose
    Stefanes, Marco A.
    ALGORITHMICA, 2009, 53 (01) : 35 - 49
  • [8] Exact algorithms for finding the minimum independent dominating set in graphs
    Liu, Chunmei
    Song, Yinglei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 439 - +
  • [9] Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching
    Gupta, Manoj
    Khan, Shahbaz
    2021 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2021, : 86 - 91
  • [10] Approximation algorithms for maximum independent set of a unit disk graph
    Das, Gautam K.
    De, Minati
    Kolay, Sudeshna
    Nandy, Subhas C.
    Sur-Kolay, Susmita
    INFORMATION PROCESSING LETTERS, 2015, 115 (03) : 439 - 446
12345