Sciweavers

Share
IWOCA
2010
Springer

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes

8 years 5 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
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.
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle
Added 19 May 2011
Updated 19 May 2011
Type Journal
Year 2010
Where IWOCA
Authors Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
Comments (0)
books