Fast Algorithms for max independent set

Authors:
Nicolas Bourgeois;Bruno Escoffier;Vangelis T. Paschos;Johan M. M. van Rooij
Affiliations:
Université Paris-Dauphine, LAMSADE, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cédex 16, France;Université Paris-Dauphine, LAMSADE, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cédex 16, France;Université Paris-Dauphine, LAMSADE, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cédex 16, France;Universiteit Utrecht, Department of Information and Computing Sciences, Utrecht, The Netherlands
Venue:
Algorithmica
Year:
2012

Citing 0
Cited 8

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Discrete Applied Mathematics
Exact algorithms for dominating set

Discrete Applied Mathematics
An exact exponential time algorithm for counting bipartite cliques

Information Processing Letters
Algorithms for dominating clique problems

Theoretical Computer Science
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

Theoretical Computer Science
Fast algorithms for min independent dominating set

Discrete Applied Mathematics
Solving min ones 2-sat as fast as vertex cover

Theoretical Computer Science
Computing the differential of a graph: Hardness, approximability and exact algorithms

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We first propose a method, called “bottom-up method” that, informally, “propagates” improvement of the worst-case complexity for “sparse” instances to “denser” ones and we show an easy though non-trivial application of it to the min set cover problem. We then tackle max independent set. Here, we propagate improvements of worst-case complexity from graphs of average degree d to graphs of average degree greater than d. Indeed, using algorithms for max independent set in graphs of average degree 3, we successively solve max independent set in graphs of average degree 4, 5 and 6. Then, we combine the bottom-up technique with measure and conquer techniques to get improved running times for graphs of maximum degree 5 and 6 but also for general graphs. The computation bounds obtained for max independent set are O ∗(1.1571 n ), O ∗(1.1895 n ) and O ∗(1.2050 n ), for graphs of maximum (or more generally average) degree 4, 5 and 6 respectively, and O ∗(1.2114 n ) for general graphs. These results improve upon the best known results for these cases for polynomial space algorithms.