Linear-Time Minimal Cograph Editing.

We present an algorithm for computing a minimal editing of an arbitrary graph G into a cograph, i.e. a set of edits (additions and deletions of edges) that turns G into a cograph and that is minimal for inclusion. Our algorithm runs in linear time in the size of the input graph, that is \(O(n+m)\) time where n and m are the number of vertices and the number of edges of G, respectively.