Cograph Editing in O(3^n n) time and O(2^n) space

11/15/2017

∙

by   W. Timothy J. White, et al.

∙

0

∙

share

We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an n-vertex graph that runs in O(3^n n) time and uses O(2^n) space. In this problem, we are given a graph G = (V, E) and the task is to find a smallest possible set F ⊆ V × V of vertex pairs such that (V, E F) is a cograph (or P_4-free graph), where represents the symmetric difference operator. We also describe a technique for speeding up the performance of the algorithm in practice.