Sciweavers

Share
CATS
2008

Parameterized Complexity of the Clique Partition Problem

9 years 5 months ago
Parameterized Complexity of the Clique Partition Problem
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem from the point of view of parameterized complexity. We show that this problem is fixed parameter tractable if we choose the number of cliques as parameter. In particular, we show that in polynomial time, a kernel bounded by k2 can be obtained, where k is the number of cliques. We also give an O(2((k+3) log k)/2 n) algorithm for this problem in K4-free graphs.
Egbert Mujuni, Frances A. Rosamond
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where CATS
Authors Egbert Mujuni, Frances A. Rosamond
Comments (0)
books