Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
431652 | Journal of Discrete Algorithms | 2012 | 7 Pages |
Abstract
The maximum independent set problem is known to be NP-hard for graphs in general, but is solvable in polynomial time for graphs in many special classes. It is also known that the problem is generally intractable from a parameterized point of view. A simple Ramsey argument implies the fixed-parameter tractability of the maximum independent set problem in classes of graphs of bounded clique number. Beyond this observation very little is known about the parameterized complexity of the problem in restricted graph families. In the present paper we develop fpt-algorithms for graphs in some classes extending graphs of bounded clique number.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Konrad Dabrowski, Vadim Lozin, Haiko Müller, Dieter Rautenbach,