Parameterized algorithms for the independent set problem in some hereditary graph classes
Dabrowski, Konrad, Lozin, Vadim V., Muller, H. and Rautenbach, Dieter (2011) Parameterized algorithms for the independent set problem in some hereditary graph classes. In: 21st International Workshop on Combinatorial Algorithms, KCL Dept Informat, London, England, 26-28 Jul 2010 . Published in: Lecture Notes in Computer Science, Vol.6460 pp. 1-9.Full text not available from this repository.
Official URL: http://springerlink.com/content/105633/
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.
|Item Type:||Conference Item (Paper)|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||Faculty of Science > Mathematics|
|Journal or Publication Title:||Lecture Notes in Computer Science|
|Page Range:||pp. 1-9|
|Access rights to Published version:||Restricted or Subscription Access|
|Conference Paper Type:||Paper|
|Title of Event:||21st International Workshop on Combinatorial Algorithms|
|Type of Event:||Workshop|
|Location of Event:||KCL Dept Informat, London, England|
|Date(s) of Event:||26-28 Jul 2010|
Actions (login required)