The Multi-parameterized Cluster Editing Problem
The Cluster Editing problem seeks a transformation of a given undirected graph into a transitive graph via a minimum number of edge-edit operations. Existing algorithms often exhibit slow performance and could deliver clusters of no practical significance, such as singletons. A constrained version of Cluster Editing is introduced, featuring more input parameters that set a lower bound on the size of a clique-cluster as well as upper bounds on the amount of both edge-additions and deletions per vertex. The new formulation allows us to solve Cluster Editing (exactly) in polynomial time when edge-edit operations per vertex is smaller than half the minimum cluster size. Moreover, we address the case where the new edge addition and deletion bounds (per vertex) are small constants. We show that Cluster Editing has a linear-size kernel in this case.
KeywordsAdjacent Vertex Reduction Procedure Common Neighbor Reduction Rule Cluster Graph
Unable to display preview. Download preview PDF.
- 7.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)Google Scholar
- 8.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
- 9.Ghrayeb, A.: Improved search-tree algorithms for the cluster edit problem. MS thesis, Lebanese American University (2011)Google Scholar
- 14.Langston, M.A.: Private communication (2012)Google Scholar
- 15.Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)Google Scholar