Editing the Simplest Graphs
We study the complexity of editing a graph into a target graph with any fixed critical-clique graph. The problem came up in practice, in mining a huge word similarity graph for well structured word clusters. It also adds to the rich field of graph modification problems. We show in a generic way that several variants of this problem are in SUBEPT. As a special case, we give a tight time bound for edge deletion to obtain a single clique and isolated vertices, and we round up this study with NP-completeness results for a number of target graphs.
KeywordsVertex Cover Input Graph Edge Deletion Complete Multipartite Graph Clique Size
Unable to display preview. Download preview PDF.
- 5.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)Google Scholar
- 7.Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight Bounds for Parameterized Complexity of Cluster Editing. In: Portier, N., Wilke, T. (eds.) STACS 2013, Dagstuhl. LIPIcs, vol. 20, pp. 32–43 (2013)Google Scholar
- 12.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Math. and its Appl. Oxford Univ. Press (2006)Google Scholar