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 条
  • [11] Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
    Chan, Timothy M.
    Har-Peled, Sariel
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 333 - 340
  • [12] Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
    Chan, Timothy M.
    Har-Peled, Sariel
    DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 48 (02) : 373 - 392
  • [13] Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
    Timothy M. Chan
    Sariel Har-Peled
    Discrete & Computational Geometry, 2012, 48 : 373 - 392
  • [14] A note on greedy algorithms for the maximum weighted independent set problem
    Sakai, S
    Togasaki, M
    Yamazaki, K
    DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 313 - 322
  • [15] GreedyMAX-type Algorithms for the Maximum Independent Set Problem
    Borowiecki, Piotr
    Goering, Frank
    SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 146 - 156
  • [16] GreedyMAX-type algorithms for the maximum independent set problem
    Department of Algorithms and System Modeling, Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Narutowicza 11/12, 80-233 Gdańsk, Poland
    不详
    Lect. Notes Comput. Sci., (146-156):
  • [17] An exact algorithm for maximum independent set in degree-5 graphs
    Xiao, Mingyu
    Nagamochi, Hiroshi
    DISCRETE APPLIED MATHEMATICS, 2016, 199 : 137 - 155
  • [18] Fast And Simple Approximation Algorithms for Maximum Weighted Independent Set of Links
    Wan, Peng-Jun
    Jia, Xiaohua
    Dai, Guojun
    Du, Hongwei
    Frieder, Ophir
    2014 PROCEEDINGS IEEE INFOCOM, 2014, : 1653 - 1661
  • [19] SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
    Agnarsson, Geir
    Halldorsson, Magnus M.
    Losievskaja, Elena
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 12 - +
  • [20] SDP-based algorithms for maximum independent set problems on hypergraphs
    Agnarsson, Geir
    Halldorsson, Magnus M.
    Losievskaja, Elena
    THEORETICAL COMPUTER SCIENCE, 2013, 470 : 1 - 9
12345