Abstract
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. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Damaschke, P., & Mogren, O. (2014). Editing the simplest graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8344 LNCS, pp. 249–260). Springer Verlag. https://doi.org/10.1007/978-3-319-04657-0_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
