Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s

Marc Hellmuth, Adrian Fritz, Nicolas Wieseke +1

Cographs are graphs in which no four vertices induce a simple connected path $P_4$. Cograph editing is to find for a given graph $G=(V,E)$ a set of at most $k$ edge additions and…