An improved exact algorithm for maximum independent set in sparse graphs

Nicolas Bourgeois (1) , Bruno Escoffier (1) , Vangelis Paschos (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

We present an O *(1.0977n) tree-search based exact algorithm for max independent set in graphs with maximum degree 3. It can be easily seen that this algorithm also works in graphs with average degree 3.

Domaines: Algorithme et structure de données [cs.DS]; Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. An improved exact algorithm for maximum independent set in sparse graphs. 2008. ⟨hal-00907599⟩