论文信息 - A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3 - 字舞流文

A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3

We present an O(1.1034) algorithm computing a maximum independent set of a graph with maximal degree 3. This result improves currently best upper bound of O(1.1255) for the problem obtained by Chen et al [2].

Igor Razgon | Igor Razgon

[1] Fabrizio Grandoni,et al. Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms , 2005, Bull. EATCS.

[2] Robert E. Tarjan,et al. Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[3] Ge Xia,et al. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, Algorithmica.

[4] Fabrizio Grandoni,et al. Measure and conquer: a simple O(20.288n) independent set algorithm , 2006, SODA '06.

[5] Richard Beigel,et al. Finding maximum independent sets in sparse and general graphs , 1999, SODA '99.

[6] Fabrizio Grandoni,et al. Measure and Conquer: Domination - A Case Study , 2005, ICALP.

[7] Igor Razgon. Exact Computation of Maximum Induced Forest , 2006, SWAT.

[8] Ge Xia,et al. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, ISAAC.