Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
Given an undirected graph G and a positive integer k, the NP-hard Sparse Split Graph Editing problem asks to transform G into a graph that consists of a clique plus isolated vertices by performing at most k edge insertions and deletions; similarly, the \(P_3\)-Bag Editing problem asks to transform G into a graph which is the union of two possibly overlapping cliques. We give a simple linear-time 3-approximation algorithm for Sparse Split Graph Editing, an improvement over a more involved known factor-3.525 approximation. Further, we show that \(P_3\)-Bag Editing is NP-complete. Finally, we present a kernelization scheme for both problems and additionally for the 2-Cluster Editing problem. This scheme produces for each fixed \(\varepsilon \) in polynomial time a kernel of order \(\varepsilon k\). This is, to the best of our knowledge, the first example of a kernelization scheme that converges to a known lower bound.
KeywordsDegree Sequence Graph Class Graph Edit Split Graph Edge Deletion
Unable to display preview. Download preview PDF.
- 7.Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer (2013)Google Scholar
- 9.Fernau, H.: Parameterized algorithmics: A graph-theoretic approach. Wilhelm-Schickard-Institut für Informatik. Universität Tübingen, Habilitationsschrift (2005)Google Scholar
- 17.Kováč, I., Selečéniová, I., Steinová, M.: On the clique editing problem. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 469–480. Springer, Heidelberg (2014) Google Scholar
- 21.Wu, B.Y., Chen, L.-H.: Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions. Algorithmica (2014, to appear). doi:10.1007/s00453-014-9874-8Google Scholar
- 22.Xie, W.: Obstructions to trigraph homomorphisms. Master’s thesis, School of Computing Science. Simon Fraser University, British Columbia, Canada (2006)Google Scholar