Parameterized algorithms for the independent set problem in some hereditary graph classes

Authors:
Konrad Dabrowski;Vadim Lozin;Haiko Müller;Dieter Rautenbach
Affiliations:
DIMAP, University of Warwick, Coventry, UK;DIMAP, University of Warwick, Coventry, UK;School of Computing, University of Leeds, Leeds, UK;Institut für Optimierung und Operations Research, Universität Ulm, Ulm, Germany
Venue:
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Year:
2010

Citing 18
Cited 1

Primitivity is hereditary for 2-structures

Theoretical Computer Science
On the homogenous representation of interval graphs

Journal of Graph Theory
Computing independent sets in graphs with large girth

Discrete Applied Mathematics
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
Stable sets in certain P6-free graphs

Discrete Applied Mathematics
An augmenting graph approach to the stable set problem in P5-free graphs

Discrete Applied Mathematics
Polynomial algorithm for finding the largest independent sets in graphs without forks

Discrete Applied Mathematics
Augmenting graphs for independent sets

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem

Theoretical Computer Science
On finding augmenting graphs

Discrete Applied Mathematics
Solving some NP-complete problems using split decomposition

Discrete Applied Mathematics
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On the parameterized complexity of multiple-interval graph problems

Theoretical Computer Science
Triangles, 4-cycles and parameterized (in-)tractability

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Fixed parameter tractability of independent set in segment intersection graphs

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity

Parameterized Complexity

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is also intractable from a parameterized point of view. However, very little is known about parameterized complexity of the problem in restricted graph classes. In the present paper, we analyse two techniques that have previously been used to solve the problem in polynomial time for graphs in particular classes and apply these techniques to develop fpt-algorithms for graphs in some classes where the problem remains NP-complete.