NP-completeness results for edge modification problems

The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs have a lot of applications in different areas, and many polynomial-time algorithms and NP-completeness proofs for this kind of problems are known. In this work we prove new NP-completeness results for these problems in some graph classes, such as interval, circular-arc, permutation, circle, bridged, weakly chordal and clique-Helly graphs. Key words: computational complexity, edge modification problems, graph classes, NP-completeness.

• Type: Journal
• Year: 2006
• Where: DAM
• Authors: Pablo Burzyn, Flavia Bonomo, Guillermo Durán
• Keywords: Certain Property, DAM 2006, Edge Modification Problems, NP-completeness