An O*(1.0977n) exact algorithm for MAX INDEPENDENT SET in sparse graphs

Authors:
N. Bourgeois;B. Escoffier;V. Th. Paschos
Affiliations:
LAMSADE, CNRS, UMR and Université Paris-Dauphine, Paris Cedex 16, France;LAMSADE, CNRS, UMR and Université Paris-Dauphine, Paris Cedex 16, France;LAMSADE, CNRS, UMR and Université Paris-Dauphine, Paris Cedex 16, France
Venue:
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Year:
2008

Citing 5
Cited 8

Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Pathwidth of cubic graphs and exact algorithms

Information Processing Letters
A faster algorithm for finding maximum independent sets in sparse graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3

Journal of Discrete Algorithms
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function

ACM Transactions on Algorithms (TALG)
A note on vertex cover in graphs with maximum degree 3

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Discrete Applied Mathematics
Maximum independent set in graphs of average degree at most three in O(1.08537n)

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A bottom-up method and fast algorithms for MAX INDEPENDENT SET

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
A simple and fast algorithm for maximum independent set in 3-degree graphs

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an O*(1.0977n) search-tree based exact algorithmfor 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.