Complexity and parameterized algorithms for Cograph Editing

@article{Liu2012ComplexityAP,
  title={Complexity and parameterized algorithms for Cograph Editing},
  author={Yunlong Liu and Jianxing Wang and Jiong Guo and Jianer Chen},
  journal={Theor. Comput. Sci.},
  year={2012},
  volume={461},
  pages={45-54}
}
Cograph Editing is to find for a given graph G = (V , E) a set of at most k edge additions and deletions that transform G into a cograph. The computational complexity of this problem was open in the past. In this paper, we first show that this problem is NP-hard by a reduction from Exact 3-Cover. Subsequently, we present a parameterized algorithm based on a… CONTINUE READING