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 条

[21] EFFICIENT ALGORITHMS FOR THE MAXIMUM WEIGHT CLIQUE AND MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS ON PERMUTATION GRAPHS
CHANG, MS
WANG, FH
INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 293 - 295
[22] Exact algorithms for dominating set
van Rooij, Johan M. M.
Bodlaender, Hans L.
DISCRETE APPLIED MATHEMATICS, 2011, 159 (17) : 2147 - 2164
[23] A Note on the P-time Algorithms for Solving the Maximum Independent Set Problem
Esfahani, Navid Nasr
Mazrooei, Parisa
Mahdaviani, Kaveh
Omoomi, Behnaz
2009 2ND CONFERENCE ON DATA MINING AND OPTIMIZATION, 2009, : 72 - +
[24] Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
Mingyu Xiao
Sen Huang
Xiaoyu Chen
Algorithmica, 2024, 86 : 1293 - 1334
[25] Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
Xiao, Mingyu
Huang, Sen
Chen, Xiaoyu
ALGORITHMICA, 2024, 86 (05) : 1293 - 1334
[26] Approximation Algorithms for Maximum Weight Independent Set of Links Under the SINR Model
Wang, Lixin
Xu, Xiaohua
AD HOC & SENSOR WIRELESS NETWORKS, 2013, 17 (3-4) : 293 - 311
[27] TABARIS - AN EXACT ALGORITHM BASED ON TABU SEARCH FOR FINDING A MAXIMUM INDEPENDENT SET IN A GRAPH
FRIDEN, C
HERTZ, A
DEWERRA, D
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (05) : 437 - 445
[28] Neural Maximum Independent Set
Pontoizeau, Thomas
Sikora, Florian
Yger, Florian
Cazenave, Tristan
MACHINE LEARNING AND PRINCIPLES AND PRACTICE OF KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2021, PT I, 2021, 1524 : 223 - 237
[29] Maximum Independent Set of Rectangles
Chalermsook, Parinya
Chuzhoy, Julia
PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 892 - +
[30] Maximum Genus and Independent Set
Dong, Guanghua
Ren, Han
Huang, Yuanqiu
Wang, Ning
ARS COMBINATORIA, 2019, 143 : 39 - 45

← 1 2 3 4 5 →