Editing the simplest graphs
Paper in proceedings, 2014

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.

word cluster

cluster editing

NP-completeness

fixed-parameter tractability

Author

Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Olof Mogren

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 8344 249-260

Areas of Advance

Information and Communication Technology

Roots

Basic sciences

Subject Categories

Computer Science

Discrete Mathematics

DOI

10.1007/978-3-319-04657-0_24

ISBN

978-3-319-04657-0

More information

Created

10/8/2017