Fast algorithms for MAX INDEPENDENT SET in graphs of small average degree - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2008

Fast algorithms for MAX INDEPENDENT SET in graphs of small average degree

Résumé

max independent set is a paradigmatic problem in theoretical computer science and numerous studies tackle its resolution by exact algorithms with non-trivial worstcase complexity. The best such complexity is, to our knowledge, the O*(1.1889n) algorithm claimed by (J. M. Robson, Finding a maximum independent set in time O(2n/4), Technical Report 1251-01, LaBRI, Université de Bordeaux I, 2001) in his unpublished technical report. We also quote the O*(1.2210n) algorithm by (F. V. Fomin, F. Grandoni and D. Kratsch, Measure and conquer: a simple O(20.288n) independent set algorithm, Proc. SODA?06, pages 18?25, 2006), that is the best published result about max independent set. In this paper we settle max independent set in (connected) graphs with "small" average degree, more precisely with average degree at most 3, 4, 5 and 6. Dealing with exact computation of max independent set in graphs of average degree at most 3, the best bound known is the recent O*(1.0977n) bound by (N. Bourgeois, B. Escoffier and V. Th. Paschos, An O*(1.0977n) exact algorithm for max independent set in sparse graphs, Proc. IWPEC?08, LNCS 5018, pages 55?65, 2008). Here we improve this result down to O*(1.0854n) by proposing finer and more powerful reduction rules. We then propose a generic method showing how improvement of the worst-case complexity for max independent set in graphs of average degree d entails improvement of it in any graph of average degree greater than d and, based upon it, we tackle max independent set in graphs of average degree 4, 5 and 6. For max independent set in graphs with average degree 4, we provide an upper complexity bound of O*(1.1571n), obviously still valid for graphs of maximum degree 4, that outperforms the best known bound of O*(1.1713n) by (R. Beigel, Finding maximum independent sets in sparse and general graphs, Proc. SODA'99, pages 856-857, 1999). For max independent set in graphs of average degree at most 5 and 6, we provide bounds of O*(1.1969n) and O*(1.2149n), respectively, that improve upon the corresponding bounds of O*(1.2023n) and O*(1.2172n) in graphs of maximum degree 5 and 6 by (Fomin et al., 2006). Let us remark that in the cases of graphs of average degree at most 3 and 4, our bounds outerperform the O*(1.1889n) claimed by (Robson, 2001).
Fichier principal
Vignette du fichier
cahierLamsade277.pdf (504.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00321618 , version 1 (15-09-2008)

Identifiants

  • HAL Id : hal-00321618 , version 1

Citer

Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, J. M. M. van Rooij. Fast algorithms for MAX INDEPENDENT SET in graphs of small average degree. 2008. ⟨hal-00321618⟩
143 Consultations
70 Téléchargements

Partager

Gmail Facebook X LinkedIn More